Gigantic prime

A gigantic prime is a prime number with at least 10,000 decimal digits.
The term appeared in Journal of Recreational Mathematics in the article "Collecting gigantic and titanic primes" (1992) by Samuel Yates. Chris Caldwell, who continued Yates' collection in The Prime Pages, reports that he changed the requirement from Yates' original 5,000 digits to 10,000 digits, when he was asked to revise the article after the death of Yates. Few primes of that size were known then, but a modern personal computer can find many in a day.
First discoveries
The first discovered gigantic prime was the Mersenne prime 2 − 1. It has 13,395 digits and was found in 1979 by Harry L. Nelson and David Slowinski.
The smallest gigantic prime is 10 + 33603. It was proved prime in 2003 by Jens Franke, Thorsten Kleinjung and Tobias Wirth with their own distributed ECPP program. It was the largest ECPP proof at the time.
The first gigantic primes are 10 + n for n = 33603, 55377, 70999, 78571, 97779, 131673, 139579, 236761, 252391, 282097, 333811, 342037, 355651, 359931, 425427, 436363, 444129, 473143, 479859, 484423, 515787, 543447, 680979, 684273, 709053, 709431, 780199, 781891, 788527, 813019, ...
The first discovered gigantic twin prime was the 11,713-digit 242206083 × 2 ± 1, found by Karl-Heinz Indlekofer and Antal Járai in 1995.
The first discovered gigantic prime triplet was the 10,047-digit 2072644824759 × 2 + d for d = −1, +1, +5, found by Norman Luhn and François Morain in 2008.

Main Menu

See Also

Main Menu