Digital Root Calculator
Test cases replayed : 4 of 4 match · Methodology · No outside source listed
Enter a whole number to get its digital root and its remainder when divided by 9.
Result
Digital root
Remainder of n ÷ 9
- Divisible by 9?
Estimate for planning only, not tax, legal, financial or medical advice. This calculator uses the method explained on this page.
This browser did not allow copying. The sentence is in the box below, already selected: copy it with your keyboard or the menu.
How to use this calculator
Fill in the fields in this order; each step takes you to its field.
- Whole number (0 or more): enter 0 or more.
- Read the result: Digital root; the panel also shows Remainder of n ÷ 9 and Divisible by 9?.
How this calculator works
The digital root is obtained by adding the digits of a number, then the digits of the result, until one digit remains. Because 10 ≡ 1 (mod 9), every digit sum keeps the remainder mod 9, so for n > 0 the digital root is 1 + (n − 1) mod 9, and it is 0 only for n = 0.
A number is divisible by 9 exactly when its digital root is 9 (and by 3 when it is 3, 6 or 9), the basis of the old check called casting out nines. Exact for whole numbers up to 9,007,199,254,740,991.
The formula
| Symbol | Meaning |
|---|---|
| Whole number (0 or more) | |
| Digital root | |
floor(x) | the largest whole number not above x. |
Worked example
| Whole number (0 or more) | 65,536 |
|---|
| Remainder of n ÷ 9 | 7 |
|---|---|
| Divisible by 9? | No |
Digital root 7
Each step uses the unrounded value of the step before it; figures on this page are rounded for display.
Frequently asked questions
What is the digital root of 65,536?
6 + 5 + 5 + 3 + 6 = 25, then 2 + 5 = 7; directly, 1 + 65,535 mod 9 = 7.
What is the digital root of 493,193?
4 + 9 + 3 + 1 + 9 + 3 = 29, 2 + 9 = 11, 1 + 1 = 2.