OFFSET
1,1
COMMENTS
In 1999 Cook showed that an odd perfect number with k distinct prime factors has c^c^k as an upper bound, where c denotes this constant.
REFERENCES
R. J. Cook, Bounds for odd perfect numbers. In Number Theory (edited by R. Gupta). CRM Proc. Lecture Notes #19, 67-71. Amer. Math. Soc., Providence, RI, 1999.
Paulo Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. See p. 84.
LINKS
EXAMPLE
2.1239671798735903147948238361697707358661856...
MATHEMATICA
RealDigits[195^(1/7), 10, 100][[1]]
CROSSREFS
KEYWORD
AUTHOR
Stefano Spezia, Apr 03 2025
STATUS
approved
