Multiply all the digits of a number n by each other, repeating with the product until a single digit is obtained. The number of steps required is known as the multiplicative persistence, and the final digit obtained is called the multiplicative digital root of n.

196-algorithm | additive persistence | digitaddition | digital root | Kaprekar number | multiplicative digital root | narcissistic number | number length | recurring digital invariant