Consider the process of taking a number, taking its digit sum, then adding the digits of numbers derived from it, etc., until the remaining number has only one digit. The number of additions required to obtain a single digit from a number n in a given base is called the additive persistence of n, and the digit obtained is called the digital root of n.

additive persistence | casting out nines | digitaddition | digit sum | Kaprekar number | multiplicative digital root | multiplicative persistence | narcissistic number | recurring digital invariant | self number