Digital Root Calculator — Repeated Digit Summation
Keep adding digits until you reach a single digit — that is the digital root. Enter any whole number to see the step-by-step reduction.
Single digit reached after 2 reduction(s)
Original number
Step 1: sum digits
Step 2: sum digits
- 1
Sum all digits
45 - 2
Apply congruence formula: 1 + ((S − 1) mod 9)
1 + ((45 − 1) mod 9) = 9Every integer is congruent to its digit sum mod 9; this maps the remainder to the single-digit root.
How does this calculator work?
The digital root reduces a number to a single digit by repeatedly summing its digits. For any positive n, the formula dr(n) = 1 + ((n − 1) mod 9) gives the same answer without iteration — because all integers are congruent to their digit sum mod 9. The digital root equals 9 for multiples of 9, and 0 only for n = 0.
Formula
How this is calculated
The digital root of a positive integer is the single-digit value obtained by repeatedly summing the digits until only one digit remains. For 9875 the process is 9+8+7+5 = 29 → 2+9 = 11 → 1+1 = 2, so the digital root is 2. The number of iterations required is called the additive persistence.
Rather than iterating, the digital root can be computed directly using the congruence formula: dr(n) = 1 + ((n − 1) mod 9) for any positive integer. This works because every integer is congruent to the sum of its digits modulo 9 (casting out nines). A number divisible by 9 has a digital root of 9; a number leaving remainder r when divided by 9 has a digital root of r. The only special cases are n = 0 (digital root = 0) and single-digit numbers (digital root = the number itself).
This calculator processes the number as a string, so it handles arbitrarily large integers without floating-point precision loss. Leading zeros are stripped before processing.
Frequently asked questions
Digital roots are used in divisibility checks (a number is divisible by 9 if its digital root is 9), error-detection algorithms, numerology, and recreational mathematics. They also appear in modular arithmetic proofs.
Each power of 10 is congruent to 1 mod 9 (10 ≡ 1, 100 ≡ 1, …), so any number n ≡ sum of its digits (mod 9). Repeatedly summing digits therefore preserves the remainder mod 9. The digital root maps this remainder to 1–9 (using 9 for multiples of 9) instead of 0–8.
No. The digital root is always a single digit from 0 to 9. Once the sum of digits is itself a single digit, the process stops. A digital root of 0 is only possible for n = 0.
Also known as
TG we-Calculate Editorial Team. (2026). Digital Root Calculator — Repeated Digit Summation [Online calculator]. TG we-Calculate. https://we-calculate.com/calculator/digital-root-calculator
TG we-Calculate Editorial Team. "Digital Root Calculator — Repeated Digit Summation." TG we-Calculate. 2026. https://we-calculate.com/calculator/digital-root-calculator.
TG we-Calculate Editorial Team, "Digital Root Calculator — Repeated Digit Summation," TG we-Calculate, 2026. [Online]. Available: https://we-calculate.com/calculator/digital-root-calculator
@misc{wecalculate_digital_root_calculator, title = {Digital Root Calculator — Repeated Digit Summation}, author = {{TG we-Calculate Editorial Team}}, howpublished = {\url{https://we-calculate.com/calculator/digital-root-calculator}}, year = {2026}, note = {TG we-Calculate} }
Did this calculator help you?