Understanding digital roots and divisibility by 9
A number's digital root reveals its remainder when divided by 9, which gives a fast mental check for divisibility by 3 and 9.
| Digital root | Relationship to divisibility |
|---|---|
| 9 | The number is exactly divisible by 9 (and therefore also by 3) |
| 3 or 6 | The number is divisible by 3 but not by 9 |
| 1, 2, 4, 5, 7, or 8 | The number is not divisible by 3 |
| 0 | Only the number 0 itself has a digital root of 0 |
- The digital root formula and its use as a 'casting out nines' arithmetic check predate modern computers and were historically used by bookkeepers and students to catch transcription and addition errors by hand.
- Digital root should not be confused with digit sum: the digit sum of 9875 is 29 (a single summing pass), while the digital root is 2 (the fully reduced single digit after repeated summing).
- This calculator treats the input as a non-negative whole number; the digits of a decimal or negative number would need to be reinterpreted before this definition applies.
What is a digital root?
The digital root of a whole number is found by adding together all of its digits, and then, if the result has more than one digit, adding those digits together again — repeating this process until a single digit (0 through 9) remains. For example, the digital root of 9875 is found by first summing 9+8+7+5=29, then summing 2+9=11, then summing 1+1=2, giving a final digital root of 2.
This repeated-digit-sum technique is sometimes called 'casting out nines,' a method historically used to spot-check arithmetic by hand: because the digital root of a number is mathematically equivalent to that number modulo 9 (using 9 in place of 0), if two numbers being added, subtracted or multiplied produce a result whose digital root does not match the expected digital-root arithmetic, an error has been made somewhere in the calculation.
Digital roots have recreational and pedagogical applications — they appear in numerology (though such uses carry no mathematical significance beyond the arithmetic itself), in simple divisibility checks (a number is divisible by 9 exactly when its digital root is 9), and as an accessible introduction to modular arithmetic and number theory for students.
How to use this digital root calculator
- Enter a non-negative whole number.
- The calculator sums all of its digits to get the initial digit sum.
- If that sum has more than one digit, the calculator repeats the digit-summing process, tracking each intermediate step.
- Read the final single-digit digital root, along with the full sequence of reduction steps and the initial digit sum before any repeated reduction.
The digital root formula and its connection to mod 9
The direct method repeatedly sums digits: for n = 9875, first sum the digits 9+8+7+5 = 29; since 29 has more than one digit, sum again 2+9 = 11; since 11 still has more than one digit, sum once more 1+1 = 2. The digital root is 2, reached in three reduction steps: 9875 → 29 → 11 → 2.
There is also a direct, non-iterative shortcut formula based on modular arithmetic: the digital root of n (for n > 0) equals 1 + ((n − 1) mod 9). Worked example: for n = 9875, (9875 − 1) mod 9 = 9874 mod 9 = 1 (since 9874 = 1097×9 + 1), so the digital root is 1 + 1 = 2 — matching the step-by-step result exactly. This formula works because summing a number's digits does not change its remainder modulo 9 (since 10 ≡ 1 mod 9, every power of 10 is also ≡ 1 mod 9).
As a special case, the digital root of 0 is defined as 0, and the digital root of any positive multiple of 9 is 9 itself (not 0), because the '+1' shift in the formula maps a remainder of 0 to a digital root of 9 rather than 0.
Common mistakes
- Stopping after only one round of digit-summing — the digital root requires repeating the process until a single digit remains, not just computing the first digit sum.
- Confusing 'digit sum' (one pass) with 'digital root' (repeated passes down to one digit) — these are related but distinct quantities, and only the digital root is guaranteed to be a single digit.
- Expecting a digital root of 0 for multiples of 9 — the digital root of any positive multiple of 9 (like 18, 27, 81) is 9, not 0; only the number 0 itself has a digital root of 0.
- Applying the technique to negative numbers or decimals without first converting them — the classic digital root definition applies to non-negative whole numbers.
よくある質問
How do you find the digital root of a number?
Sum all the digits of the number, and if the result has more than one digit, sum its digits again — repeat until only a single digit remains. For 9875: 9+8+7+5=29, then 2+9=11, then 1+1=2. The digital root of 9875 is 2.
What is the shortcut formula for digital root?
For any positive whole number n, the digital root equals 1 + ((n − 1) mod 9), avoiding the need for repeated summing. For n = 9875: (9875 − 1) mod 9 = 9874 mod 9 = 1, so the digital root is 1 + 1 = 2, matching the step-by-step method.
Why is the digital root related to mod 9?
Because 10 leaves a remainder of 1 when divided by 9 (10 = 1×9 + 1), every power of 10 also leaves a remainder of 1 mod 9. Since any whole number can be written as a sum of digits times powers of 10, summing the digits directly (ignoring their place value) preserves the number's remainder mod 9. Repeating this digit-summing process converges to that same remainder, expressed as a single digit (using 9 instead of 0).
How can digital roots check arithmetic (casting out nines)?
Casting out nines checks a calculation by comparing digital roots: for addition, the digital root of the sum should equal the digital root of the sum of the addends' digital roots; for multiplication, the digital root of the product should equal the digital root of the product of the factors' digital roots. If the digital roots don't match according to this rule, an arithmetic error has occurred somewhere — though matching digital roots does not guarantee the answer is fully correct, since some errors (like digit transpositions) can go undetected.
What is the digital root of a multiple of 9?
The digital root of any positive multiple of 9 is always 9 itself, not 0. For example, 18 → 1+8=9, 81 → 8+1=9, and 999 → 9+9+9=27 → 2+7=9. This is a direct consequence of the shortcut formula 1 + ((n−1) mod 9): when n is a multiple of 9, (n−1) mod 9 = 8, so the digital root is 1+8=9.
参考文献
- Rosen KH. Elementary Number Theory and Its Applications. 6th ed. Pearson, 2010. (Congruences and casting out nines.)
- Ore O. Number Theory and Its History. McGraw-Hill, 1948 (Dover reprint, 1988). (Historical treatment of digit sums and divisibility checks.)
- Weisstein EW. 'Digital Root' and 'Casting Out Nines.' MathWorld — A Wolfram Web Resource. mathworld.wolfram.com.