Digital Root Calculator
Enter any non-negative integer to find its digital root - the single digit you get by repeatedly adding all digits together until one digit remains. The calculator shows every reduction step, uses the fast closed-form formula for instant results, and optionally lets you explore digital roots in bases other than 10. Perfect for number theory, numerology, arithmetic verification, and classroom demonstrations.
What is a digital root?
The digital root of a positive integer is the single-digit value obtained by an iterative process of summing its digits. Starting with any whole number, you add all of its decimal digits together. If the result has more than one digit, you sum those digits again, repeating until only a single digit remains. That final digit is the digital root. For example, starting with 56,984: 5+6+9+8+4 = 32, then 3+2 = 5, so the digital root is 5. The digital root always falls in the range 1 to 9 for positive integers, with the special case that 0 has a digital root of 0. The concept has been studied since antiquity under the name "casting out nines," because the digital root of any number equals the remainder left when that number is divided by 9 (with the convention that the remainder 0 maps to 9).
The closed-form formula
Instead of repeating the digit-sum loop, you can compute the digital root instantly using the formula: digital root = n - 9 x (ceil(n / 9) - 1), where ceil is the ceiling function (the smallest integer greater than or equal to the argument). An equivalent and often simpler form is: digital root = 1 + ((n - 1) mod 9) for n > 0, and 0 for n = 0. Both expressions exploit the modular arithmetic of base 10: because 10 is congruent to 1 modulo 9, the value of a number modulo 9 equals the value of its digit sum modulo 9, which is the same as its digital root. This is exactly why the old "casting out nines" method works for checking arithmetic: the digital root is preserved under addition and multiplication, so you can verify a computed product or sum by comparing the digital root of the answer to the digital root of the expected result.
Properties and patterns
Digital roots have several elegant properties that make them useful both practically and mathematically. First, the digital root is preserved under addition and multiplication: if dr(a) and dr(b) are the digital roots of two numbers, then dr(a + b) = dr(dr(a) + dr(b)) and dr(a x b) = dr(dr(a) x dr(b)). This homomorphism property is why digit-based arithmetic checks work. Second, any multiple of 9 has a digital root of 9, and adding 9 to any number leaves its digital root unchanged. Third, perfect squares can only have digital roots of 1, 4, 7, or 9, so if a number has digital root 2, 3, 5, 6, or 8, it cannot be a perfect square. The Fibonacci sequence, when reduced to digital roots, produces a cycle of length 24 before repeating. Powers of 2 cycle with period 6, and powers of 10 all have digital root 1. These cyclic patterns are a window into the deeper periodic structure of modular arithmetic.
Digital roots in other bases
The concept generalizes naturally to any number base b: the digital root of n in base b is the remainder of n divided by (b - 1), with the convention that remainder 0 maps to b - 1. In binary (base 2), every positive integer has a digital root of 1, since b - 1 = 1, which makes the digital root trivial. In hexadecimal (base 16), the digital root cycles through 1 to 15 (with F representing 15), and all multiples of 15 have digital root F. The octal (base 8) digital root gives the remainder modulo 7, which was historically used in Fortran error-checking routines. The calculator above lets you explore digital roots in binary, octal, decimal, dozenal (base 12), and hexadecimal, providing intuition for how the casting-out-nines trick extends across different numeral systems.
Digital roots of common number sequences (base 10)
| Sequence | First few terms | Digital root pattern |
|---|---|---|
| Natural numbers 1-9 | 1, 2, 3, 4, 5, 6, 7, 8, 9 | 1, 2, 3, 4, 5, 6, 7, 8, 9 (repeats) |
| Multiples of 9 | 9, 18, 27, 36, 45 | Always 9 |
| Multiples of 3 | 3, 6, 9, 12, 15 | 3, 6, 9, 3, 6, 9 (cycles) |
| Perfect squares | 1, 4, 9, 16, 25, 36 | 1, 4, 9, 7, 7, 9 (only 1,4,7,9 possible) |
| Fibonacci numbers | 1, 1, 2, 3, 5, 8, 13, 21 | 1,1,2,3,5,8,4,3 (24-term cycle) |
| Powers of 2 | 1, 2, 4, 8, 16, 32, 64 | 1,2,4,8,7,5,1 (6-term cycle) |
| Triangular numbers | 1, 3, 6, 10, 15, 21 | 1,3,6,1,6,3 (9-term cycle) |
Digital roots cycle predictably across many well-known integer sequences.
Frequently asked questions
What is the digital root of 0?
By convention, the digital root of 0 is 0. Every other non-negative integer has a digital root between 1 and 9 (in base 10). Zero is the only number that violates the 1-to-9 range, and it is handled as a special case in both the iterative method and the closed-form formula.
Is the digital root the same as the sum of digits?
Not always. The digit sum is the result of adding all digits once. If that result is a single digit, it equals the digital root. But if the digit sum itself has more than one digit, you must sum again - and the digital root is the final single-digit result of repeating that process. For example, the digit sum of 99 is 18, and the digital root is 9 (because 1+8=9).
Why does multiplying a number by 9 always give digital root 9?
Because the digital root is a remainder modulo 9, and any multiple of 9 has remainder 0 when divided by 9. By convention, a remainder of 0 maps to the digital root 9 (rather than 0). So 9, 18, 27, 36, and every other multiple of 9 all have digital root 9. Equivalently, every multiple of 9 leaves no "leftover" in the casting-out-nines sense.
Can I use the digital root to check multiplication?
Yes. This is the traditional arithmetic check called casting out nines. To verify a x b = c, compute the digital roots of a, b, and c. If the multiplication is correct, then dr(a) x dr(b) should have the same digital root as dr(c). For instance, 23 x 47 = 1081: dr(23) = 5, dr(47) = 2, dr(5 x 2) = dr(10) = 1, and dr(1081) = 1. The match confirms no arithmetic error was made (though it cannot catch errors that are multiples of 9).
What digital roots are possible for perfect squares?
In base 10, a perfect square can only have a digital root of 1, 4, 7, or 9. This means you can use the digital root as a quick filter: if a number has a digital root of 2, 3, 5, 6, or 8, it is definitely not a perfect square. Numbers with roots 1, 4, 7, or 9 might or might not be perfect squares, so the digital root is a necessary but not sufficient condition.
How does the digital root work in bases other than 10?
In any base b, the digital root of a number n is computed using modular arithmetic with modulus b - 1. The iterative method still works: add the base-b digits repeatedly until a single digit remains. The closed-form shortcut gives the same answer: dr(n) = 1 + ((n-1) mod (b-1)) for n > 0. In binary (base 2), b - 1 = 1, so every positive number reduces to 1 in just one step.
What is "casting out nines" and how does it relate?
Casting out nines is a historical technique for detecting arithmetic errors, used by bookkeepers and mathematicians before electronic calculators. You discard any nines or groups of digits that add to nine during a digit sum, which is equivalent to working modulo 9. The digital root is the formal mathematical foundation of this technique: it is the canonical single-digit representative of a number in the equivalence class defined by the relation "a and b have the same digital root if and only if a and b are congruent modulo 9."