78,557
| ||||
|---|---|---|---|---|
| Cardinal | seventy-eight thousand five hundred fifty-seven | |||
| Ordinal | 78557th (seventy-eight thousand five hundred fifty-seventh) | |||
| Factorization | 17 × 4621 | |||
| Divisors | 1, 17, 4621, 78557 | |||
| Greek numeral | ͵ηφνζ´ | |||
| Roman numeral | LXXVMMMDLVII | |||
| Binary | 100110010110111012 | |||
| Ternary | 102222021123 | |||
| Quaternary | 1030231314 | |||
| Quinary | 100032125 | |||
| Senary | 14034056 | |||
| Octal | 2313358 | |||
| Duodecimal | 3956512 | |||
| Hexadecimal | 132DD16 | |||
| Vigesimal | 9G7H20 | |||
| Base 36 | 1OM536 | |||
78,557 (seventy-eight thousand five hundred [and] fifty-seven) is the natural number following 78,556 and preceding 78,558.[1]
In mathematics
Sierpiński number
Is 78,557 the smallest Sierpiński number?
78557 is conjectured as the first, and smallest Sierpiński number.[2][3][4] 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}.[5][6][2] 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.[6] The distributed volunteer computing project PrimeGrid is attempting to eliminate all the remaining values of k:[7]
- k = 21181, 22699, 24737, 55459, and 67607.[lower-alpha 1]
Notes
- ↑ See the current status for the remaining multipliers at PrimeGrid's website.
References
- ↑ Vanovschi, Vitalii. "Properties of the number 78557". www.numberempire.com. Retrieved 2026-09-25.
- ↑ 2.0 2.1 Koninck, Jean-Marie De (2009). Those Fascinating Numbers. American Mathematical Soc. ISBN 978-0-8218-4807-4. Search this book on
- ↑ 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.
- ↑ Weisstein, Eric W. "Sierpiński's Composite Number Theorem". mathworld.wolfram.com. Wolfram Research, Inc. Retrieved 2026-09-25.
- ↑ Filaseta, Michael; Finch, Carrie; Kozek, Mark (July 2008). "On powers associated with Sierpiński numbers, Riesel numbers and Polignac's conjecture". Journal of Number Theory. 128 (7): 1916–1940. doi:10.1016/j.jnt.2008.02.004.
- ↑ 6.0 6.1 "The Prime Glossary: Sierpinski number". t5k.org. Retrieved 2026-09-25.
- ↑ "Seventeen or Bust statistics". PrimeGrid. Retrieved November 21, 2019.
 | This number article is a stub. You can help EverybodyWiki by expanding it. |
This article "78,557" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:78,557. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
