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
260 (number) (43 + 47 + 53 + 59 + 61), balanced prime, Chen prime, Eisenstein prime with no imaginary part, strictly non-palindromic number, Bernoulli irregular prime, Euler irregular prime, Gaussian prime, full reptend prime, Solinas prime, Ramanujan prime. 264 = 2·3·11, Harshad number. If you take the sum of all 2-digit numbers you can make from 264, you get 264: 24 + 42 + 26 + 62 + 46 + 64 = 264. 132 and 396 share this property. 264 equals the sum of the squares of the digits of its own square in base 15. This property is shared with