5/2/2026
6 min read
The digital root of a positive integer is what you get when you repeatedly replace the number by the sum of its digits until only one digit remains. The process highlights patterns behind divisibility by 9 and quick error checks on pencil-and-paper arithmetic.
For base 10, the digital root (except mapping 9 → 9 rather than 0 for multiples of 9 in the classic definition) aligns with **n mod 9**, treating 0 as 9 when n is nonzero and divisible by 9. That is why casting out nines catches many transcription mistakes: if manual addition disagrees with the digital root shortcut, you likely dropped or duplicated a digit. Calculators that show intermediate sums make the iteration transparent instead of hiding it inside a black-box command.
Let S(n) be the sum of decimal digits of n. For n > 9, replace n by S(n) and repeat. Stop when n is a single digit. Equivalently, for n ≥ 1, digital root dr(n) = 1 + ((n − 1) mod 9) with the convention dr(0) = 0.
Take 58,934: digit sum 5+8+9+3+4 = 29, then 2+9 = 11, then 1+1 = 2. So dr(58,934) = 2. If you divide 58,934 by 9, the remainder is 2—the same residue class.
Open the Digital Root calculator, type a positive integer using digits only (no commas), then press Calculate to scroll to the step-by-step digit sums. Reset clears the field if you want another number.
Almost: for positive integers, the digital root matches n mod 9 except multiples of 9 map to 9 instead of 0. Zero is a special case with digital root 0.
It is strongest for multiples of 3 and 9. Other primes need different rules (11 alternating sums, etc.).
© 2026 PromathTools. All rights reserved.
Developed by kruskalcode.com
