How this calculation works
Positive multiples of 9 have digital root 9. Only the input zero produces digital root 0.
For n > 0, root = 1 + ((n − 1) mod 9)A worked example
582 becomes 15, then 1 + 5 = 6.
Good to know
The digital root of zero is zero.
Reference: OpenStax Prealgebra (opens in a new tab) ↗
Follow the repeated digit sums
Start with 582. Its first digit sum is 5 + 8 + 2 = 15. Since 15 has two digits, add again to get 1 + 5 = 6. Six is a single digit, so the process stops there. The diagram shows each reduction and the result table records the same sequence.
For a positive integer n, the same answer can be written as 1 + ((n − 1) mod 9). Subtracting one before taking the remainder gives values from 0 through 8, and adding one maps them to 1 through 9. This formulation makes positive multiples of 9 return 9.
Keep zero and multiples of nine distinct
Applying n mod 9 alone to 18 gives zero, while repeated digit sums give 1 + 8 = 9. The remainder and the digital root carry related information but use different representatives for positive multiples of nine. The starting number zero is the exception and has digital root zero.
Use the Digit sum calculator when you want only the first reduction. Use the Divisibility test calculator when you need the quotient remainder for a specific divisor. Digital roots can reveal some arithmetic errors because addition and multiplication preserve their residue modulo 9. Errors that change a result by a multiple of 9 can still pass this check.
A few questions, answered
Is the digital root a unique identifier?
Many integers share it. For example, 6, 15 and 24 all reduce to 6. It cannot identify the original number.
How many reductions are needed for a one-digit input?
None. Inputs from 0 through 9 already meet the stopping rule and are returned directly.