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
167 (number) its non-greedy expression as a sum of squares can be shorter, e.g. 167 = 121 + 36 + 1 + 1. 167 is a full reptend prime in base 10, since the decimal expansion of 1/167 repeats the following 166 digits: 0.00598802395209580838323353293413173652694610778443113772455089820359281437125748502994 0119760479041916167664670658682634730538922155688622754491017964071856287425149700... 167 is a highly cototient number, as it is the smallest number "k" with exactly 15 solutions to the equation "x" - φ("x") = "k". It is also a strictly non-palindromic number. 167 is the smallest multi-digit prime such that the product of digits is equal to the number of digits times the sum of the digits,