Multiply Persist Calculator

Multiply digits to one

CalculatorsFreeNo Signup
4.6(775 reviews)
All Tools

Loading tool...

About Multiply Persist Calculator

A multiplicative persistence calculator showing the full chain of digit products until reaching a single digit. Tracks the famous conjecture: max persistence is 11 (277777788888899). Displays each step with digit breakdown. Client-side.

Multiply Persist Calculator Features

  • Digit product chain
  • Step count
  • Records
  • Digit breakdown
  • Conjectures
Multiplicative persistence: multiply digits until single digit. 679→6·7·9=378→3·7·8=168→1·6·8=48→4·8=32→3·2=6. That's 5 steps. Maximum known: 11 steps (277777788888899). Sloane conjectures no number ever needs more than 11.

How to Use

Enter a number:

  • Chain: Full product sequence
  • Steps: Persistence count
  • Digits: Breakdown at each step

Persistence Records

Smallest numbers with each persistence: 0→0, 10→1, 25→2, 39→3, 77→4, 679→5, 6788→6, 68889→7, 2677889→8, 26888999→9, 3778888999→10, 277777788888899→11.

The Zero Trap

Any number with a 0 digit has persistence 1 (product=0, then 0 is single-digit). Numbers with many 1s don't help persistence either. So high-persistence numbers avoid 0s and 1s in their digits.

Step-by-Step Instructions

  1. 1Enter number.
  2. 2Multiply digits.
  3. 3Continue to single digit.
  4. 4Count steps.
  5. 5Compare records.

Multiply Persist Calculator — Frequently Asked Questions

Why is 11 the maximum?+

Nobody knows FOR SURE — it's still a conjecture! But computation up to 10^233 has found nothing beyond 11. The structure of digit products makes it nearly impossible to maintain long chains: products shrink number size very quickly.

Why do all record holders use digits 2-9?+

0 kills the chain (product becomes 0). 1 doesn't contribute to the product. So efficient high-persistence numbers use 2-9 only. Moreover, 2,3,7 are key: they produce diverse products. 4=2×2, 6=2×3, 8=2×2×2, 9=3×3 can be factored into smaller digits.

What about other bases?+

In base 2: max persistence is 1 (any multi-digit binary number has only 0s and 1s). In base 3: proven max is 3. For bases 3-10: specific bounds are known for some. The problem gets richer (and harder) in larger bases.

Share this tool: