Consider the process of taking a number, multiplying its digits, then multiplying the digits of numbers derived from it, etc., until the remaining number has only one digit. The number of multiplications required to obtain a single digit from a number n is called the multiplicative persistence of n, and the digit obtained is called the multiplicative digital root of n. For example, the sequence obtained from the starting number 9876 is (9876, 3024, 0), so 9876 has a multiplicative persistence of two and a multiplicative digital root of 0. The multiplicative digital roots of the first few positive integers are 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 2, 4, 6, 8, 0, 2, 4, 6, 8, 0, 3, 6, 9, 2, 5, 8, 2, ... (OEIS A031347).

additive persistence | digitaddition | digital root | multiplicative persistence