Digital Root Calculator

Reduce any number to its single-digit digital root and see how many summing steps it takes.

How it is calculated

Enter a whole number. The tool adds its digits, then adds the digits of that sum, and repeats until one digit is left. That digit is the digital root; the number of rounds it took is the additive persistence, shown as the second result. A number that already has one digit needs 0 rounds, and 0 gives a root of 0. The sign is ignored. Typed as plain digits, the number is processed digit by digit, so even a 20-digit value is exact. A decimal such as 98.7 shows no result, as does text or a thousands separator like 1,234; a decimal that is really whole, such as 98.0, is accepted. For a positive integer the root equals n mod 9, with 9 instead of 0 for multiples of 9.

Worked example

Take 9875. First round: 9 + 8 + 7 + 5 = 29. Second round: 2 + 9 = 11. Third round: 1 + 1 = 2. The digital root is 2 and it took 3 rounds, so the additive persistence is 3. The shortcut agrees: 9875 leaves a remainder of 2 when divided by 9, and so does 29.

Try this example →

Common mistakes

  • Stopping after one round. For 9875 the first sum, 29, still has two digits, so you must keep going to reach 2.
  • Assuming multiples of 9 have root 0. A positive multiple of 9, such as 123456789, has root 9; only 0 itself gives 0.
  • Mixing up the two outputs. The digital root is the final single digit; the additive persistence is how many rounds it took to reach it.
  • Typing a decimal or a number with separators, such as 98.7 or 1,234. The tool wants plain whole digits and shows nothing otherwise.

About this calculator

The digital root of a number is found by repeatedly summing its digits until only a single digit remains — for example, 9875 becomes 9+8+7+5=29, then 2+9=11, then 1+1=2, so its digital root is 2. The number of summing steps it takes to get there is called its additive persistence, a separate and less commonly discussed property of the same number.

There’s a shortcut behind the repeated addition: the digital root of any positive integer equals that number modulo 9 (with a digital root of 9, not 0, for exact multiples of 9). This is exactly the basis of the old “casting out nines” technique accountants and students once used to spot-check arithmetic by hand, and it still underlies certain checksum and divisibility-by-9 tricks used in computer science and numerology, where digital roots are treated as a number’s fundamental “essence.”

Enter any whole number and this calculator reduces it step by step to its single-digit digital root, showing you exactly how many summing iterations it took.

Was this helpful?

You can pick up to 3 reactions.

Comments (0)

  • Be the first to comment.

Popular calculators

All Calculators