Generalized Dudeney Numbers

A Dudeney number is a perfect cube whose decimal digits sum to its cube root. Generalize the exponent and you get a far richer hunt - this page lets you search for big ones right in your browser.

Dudeney numbers

Take the number 8 and cube it: 8 × 8 × 8 = 512. Now add up the digits of 512: 5 + 1 + 2 = 8 - right back where you started. A Dudeney number is a perfect cube that does exactly that: the digits of the cube add up to its cube root. Writing ds(x) for that digit sum (so ds(4913) = 4+9+1+3 = 17), a cube n3 qualifies exactly when ds(n3) = n. There are only six - past a point a cube has too few digits for them to ever reach its root, so the hunt is finite:

1 = 1^3 → 1 = 1 512 = 8^3 → 8 = 5+1+2 4913 = 17^3 → 17 = 4+9+1+3 5832 = 18^3 → 18 = 5+8+3+2 17576 = 26^3 → 26 = 1+7+5+7+6 19683 = 27^3 → 27 = 1+9+6+8+3

Generalization

What if we allow any exponent, not just 3? We look for integers with ds(nk) = n. For the fourth power (k = 4):

1 = 1^4 → 1 = 1 2401 = 7^4 → 7 = 2+4+0+1 234256 = 22^4 → 22 = 2+3+4+2+5+6 390625 = 25^4 → 25 = 3+9+0+6+2+5

The numbers grow fast. A few solutions for k = 20:

90^20 = 1215766545905692880100000000000000000000 → ds = 90 207^20 = 20864448472975628947226005981267194447042584001 → ds = 207

Go hunting!

Pick ranges for the base n and the exponent k and press Hunt!. The hunter iterates over every base/exponent combination, and the largest number it finds with ds(nk) = n is shown next to Biggest. The computation runs in a background thread, so the page stays responsive and you can stop it any time.

Searches every nk whose digits add up to n.

The current record is 2000000000014764030693 (a number with 152 084 723 026 digits). Raise the ranges to hunt for bigger numbers - very large values take a long time to compute.

Record history

This is the record as it grew over time - each entry was the largest known generalized Dudeney number when it was found, each one beating the previous. The top row is the current record. Click any entry to load it into the hunter and recompute it. Be warned: the current record has 4.4 billion significant digits - rebuilding it in-browser took about 3 hours and needs tens of gigabytes of memory (measured on a 34 GB desktop), and it will crash phones or low-memory machines. The rows below it are far quicker. The record is also verified offline with the tools in the repo:

Generalized Dudeney number# digitsDateFound by
1520847230262026-06-08Steffen Jakob
235896722012-07-21Resta (link)
2226262012-07-16Steffen Jakob
1755692012-07-15Steffen Jakob
1472532010-01-12Steffen Jakob
1237102010-01-11Steffen Jakob
950062010-01-07Steffen Jakob
548262010-01-06Steffen Jakob
146402010-01-05Steffen Jakob

Beat the record? The hunter shows the digit count of every number it finds. If you turn up something bigger than the top row, it is worth reporting.