Persistence of a number assumed. The single-digit final state reached in the process of calculating an integer's additive persistence is its digital root. Put another way, a number's additive persistence counts how many times we must sum its digits to arrive at its digital root. The additive persistence of 2718 is 2: first we find that 2 + 7 + 1 + 8 = 18, and then that 1 + 8 = 9. The multiplicative persistence of 39 is 3, because it takes three steps to reduce 39 to a single digit: 39 → 27 → 14 → 4. Also, 39 is the smallest
Numerical digit if formula_7, then formula_8. In the process of casting out nines, both sides of the latter equation are computed, and if they are not equal the original addition must have been faulty. Repunits are integers that are represented with only the digit 1. For example, 1111 (one thousand, one hundred and eleven) is a repunit. Repdigits are a generalization of repunits; they are integers represented by repeated instances of the same digit. For example, 333 is a repdigit. The primality of repunits is of interest to mathematicians. Palindromic numbers are numbers that read the same when their digits are reversed.