Additive Persistence Calculator

Sum digits to one

CalculatorsFreeNo Signup
4.3(600 reviews)
All Tools

Loading tool...

About Additive Persistence Calculator

An additive persistence calculator showing the full chain of digit sums until reaching a single digit (digital root). Unlike multiplicative persistence, additive persistence is unbounded — you can make it arbitrarily large. Client-side.

Additive Persistence Calculator Features

  • Digit sum chain
  • Step count
  • Digital root
  • Comparison
  • Step breakdown
Additive persistence: repeatedly sum digits until single digit. 9999→36→9. That's 2 steps. Digital root is the final value (9). Unlike multiplicative persistence (max 11), additive persistence is unbounded: use enough 9s for any desired persistence.

How to Use

Enter a number:

  • Chain: Full sum sequence
  • Persistence: Step count
  • Digital root: Final value

Unbounded Growth

Want persistence k? Use 10^(10^(k-1)) - 1 (all 9s, enough of them). Digit sum of d nines = 9d. Need 9d to also have high persistence. So chain 999...9 → 9d → ... → single digit. Just use enough 9s!

Digital Root Shortcut

Digital root = 1 + (n-1) mod 9 (if n>0). This skips ALL intermediate steps! But persistence has no shortcut — you must actually iterate. The root is predictable; the step count requires computation.

Step-by-Step Instructions

  1. 1Enter number.
  2. 2Sum digits.
  3. 3Continue until single.
  4. 4Count steps.
  5. 5Note digital root.

Additive Persistence Calculator — Frequently Asked Questions

What's the difference from multiplicative persistence?+

Additive: sum digits. Multiplicative: multiply digits. Key difference: additive is unbounded (make number bigger for more steps). Multiplicative is conjectured max 11 — multiplication shrinks numbers much faster than addition.

Can I predict the digital root without iterating?+

Yes! Digital root = 1 + (n-1) mod 9 for n>0. This is instant, no iteration needed. But this only gives the FINAL value, not the persistence (step count). There's no known shortcut for persistence itself.

What's the smallest number with persistence k?+

k=0: any single digit. k=1: 10, k=2: 19 (1+9=10, 1+0=1), k=3: 199 (19, 10, 1), k=4: 19999999999999999999999 (a 1 followed by twenty-two 9s). It grows VERY fast!

Share this tool: