Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a40c410849c9addf

Jump to content

// Workers AI · dad joke modeIs 78,557 a large number? It's a big digit-al.

From Wikipedia, the free encyclopedia
← 78556 78557 78558 →
Cardinalseventy-eight thousand five hundred fifty-seven
Ordinal78557th
(seventy-eight thousand five hundred fifty-seventh)
Factorization17 × 4621
Divisors1, 17, 4621, 78557
Greek numeral͵ηφνζ´
Roman numeralLXXVMMMDLVII, lxxvmmmdlvii
Binary100110010110111012
Ternary102222021123
Senary14034056
Octal2313358
Duodecimal3956512
Hexadecimal132DD16

78,557 (seventy-eight thousand five hundred [and] fifty-seven) is the natural number following 78,556 and preceding 78,558.[1]

In mathematics

[edit]

Sierpiński number

[edit]
Unsolved problem in mathematics
Is 78,557 the smallest Sierpiński number?

78557 is conjectured as the first, and smallest Sierpiński number.[2][3] It was proved to be one by John Selfridge in the year 1962, who showed that all numbers of the form 78557⋅2n + 1 have a factor in the covering set {3, 5, 7, 13, 19, 37, 73}.[4] But there are debates on whether 78557 is actually the smallest Sierpiński number. This is known as the Sierpiński problem.

To show that 78,557 really is the smallest Sierpiński number, one must show that all the odd numbers smaller than 78,557 are not Sierpiński numbers. That is, for every odd k below 78,557, there needs to exist a positive integer n such that k2n + 1 is prime.[4] The distributed volunteer computing project PrimeGrid is attempting to eliminate all the remaining values of k:[5]

k = 21181, 22699, 24737, 55459, and 67607.[a]

Notes

[edit]
  1. ↑ See the current status for the remaining multipliers at PrimeGrid's website.

References

[edit]
  1. ↑ Vanovschi, Vitalii. "Properties of the number 78557". www.numberempire.com. Retrieved 2026-09-25.
  2. ↑ Sloane, N. J. A. (ed.). "Sequence A076336 ((Provable) Sierpiński numbers: odd numbers n such that for all k >= 1 the numbers n*2^k + 1 are composite)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ↑ Weisstein, Eric W. "Sierpiński's Composite Number Theorem". mathworld.wolfram.com. Wolfram Research, Inc. Retrieved 2026-09-25.
  4. 1 2 "The Prime Glossary: Sierpinski number". t5k.org. Retrieved 2026-09-25.
  5. ↑ "Seventeen or Bust statistics". PrimeGrid. Retrieved November 21, 2019.