How this instrument works
A digital root is what remains after repeated digit-summing: add a number's digits, then add the digits of that sum, and repeat until exactly one digit is left. Every whole number eventually settles on a single digit from 1 through 9, and that digit is its digital root — a compressed fingerprint of the original figure.
The one-step shortcut works because 10 leaves a remainder of 1 when divided by 9, so every power of ten does too — the hundreds place, the thousands place, all of it behaves like a lone 1 once you work modulo 9. Summing digits is therefore the same operation as taking a remainder mod 9, which is why the very first digit sum already carries the answer; further rounds of summing just shrink the digit count without touching that underlying remainder. The formula ((n−1) mod 9) + 1 performs this in a single pass, with the −1/+1 pairing only there to relabel a remainder of 0 as 9, since single-digit multiples of nine (9, 18, 27…) are their own digital root and never reduce to 0.
This works because base ten uses nine as its wraparound number, and the same idea generalizes to any base b by swapping in mod (b−1) — in binary, where b−1 is 1, every nonzero number's digital root collapses to a constant 1, since summing bits repeatedly always bottoms out there. Base ten's version has real history behind it: medieval arithmeticians, including Fibonacci in his 1202 Liber Abaci, used digit-sum checks — 'casting out nines' — to spot-check long multiplication without redoing the whole calculation by hand. The technique has a blind spot worth knowing: swapping two digits (69 for 96, say) leaves the digit sum, and therefore the digital root, completely unchanged, so it catches many slips but not a transposed pair.
- Type a whole number into the Number field; the digital root recalculates the instant you change it.
- Read the result in the Digital root field — it is always a single figure from 1 through 9.
- To see the shortcut proven, sum your original number's digits by hand and keep summing until one digit remains; it will match Digital root exactly.
- Use matching digital roots to spot-check addition or multiplication by hand, the same casting-out-nines trick used before calculators existed.
Worked example — the digital root of 493
Take 493. Summed by hand: 4 + 9 + 3 = 16, still a two-digit number, so sum again: 1 + 6 = 7. Seven is a single digit, so 7 is the digital root of 493 — two rounds of addition to arrive there.
The formula reaches the same 7 in one pass: 493 − 1 = 492, and 492 divided by 9 is 54 remainder 6, so 6 + 1 = 7. No repeated summing, no intermediate 16 — just one subtraction, one remainder, and one addition, matching the hand calculation exactly.
Questions
What is a digital root?
It is the single digit, from 1 to 9, left after repeatedly summing a number's digits: sum once, and if the result still has more than one digit, sum again, until only one remains. For 493 that takes two rounds (4+9+3=16, then 1+6=7), landing on 7.
Why does the formula subtract 1 before taking the remainder?
Because a plain n mod 9 gives 0 for every multiple of nine, but the digital root of 9, 18, or 900 is 9, not 0. Subtracting 1 first shifts the range down by one, so the mod 9 step returns 0 through 8, and adding 1 back maps that onto 1 through 9 with no zero ever appearing.
Does rearranging a number's digits change its digital root?
No — addition does not care about order, so 493, 934, and 349 all share the digit sum 16 and therefore the same digital root, 7. That is also why the historical casting-out-nines check cannot catch a transposition error, such as copying 96 as 69; the digit sum, and the check, stay identical.
How does the digital root relate to divisibility by 9 and by 3?
A whole number is divisible by 9 exactly when its digital root is 9, and divisible by 3 exactly when its digital root is 3, 6, or 9. This falls straight out of the same mod-9 relationship the formula uses, since divisibility by 9 means a remainder of 0 — displayed here as 9 rather than 0.
What is 'casting out nines' and is it still useful?
It is a centuries-old shortcut for sanity-checking arithmetic: reduce each number in a calculation to its digital root, redo the calculation on those small digits, and compare results. A mismatch proves an error exists, though a match does not prove the answer correct — it misses transposition errors and any mistake that happens to preserve the digit sum.
Does the digital root idea work in number bases other than ten?
Yes — the underlying rule generalizes to mod (b − 1) for base b, so base ten uses mod 9 because 10 − 1 = 9. In binary, where b − 1 = 1, every positive number's digital root is trivially 1, since anything taken modulo 1 leaves no remainder left to distinguish.