289 · 2102150 + 1

At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important PrimePages database: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.

Description:289 · 2102150 + 1
Verification status (*):Proven
Official Comment (*):Generalized Fermat
Proof-code(s): (*):g143 : Eckhard, Proth.exe
Decimal Digits:30753   (log10 is 30752.674954918)
Rank (*):63323 (digit rank is 1)
Entrance Rank (*):368
Currently on list? (*):no
Submitted:12/22/1999 08:35:12 CDT
Last modified:12/22/1999 08:35:12 CDT
Removed (*):1/12/2003 15:42:42 CDT
Database id:4246
Status Flags:none
Score (*):35.9163 (normalized score 0.0001)

Archival tags:

There are certain forms classed as archivable: these prime may (at times) remain on this list even if they do not make the Top 5000 proper.  Such primes are tracked with archival tags.
Generalized Fermat (archivable *)
Prime on list: no, rank 3954
Subcategory: "Generalized Fermat"
(archival tag id 206532, tag last modified 2021-12-03 20:37:45)

Verification data:

The Top 5000 Primes is a list for proven primes only. In order to maintain the integrity of this list, we seek to verify the primality of all submissions.  We are currently unable to check all proofs (ECPP, KP, ...), but we will at least trial divide and PRP check every entry before it is included in the list.
fieldvalue
prime_id4246
person_id9
machineWinXP Athlon 1.3GHz
whatprime
notesPFGW Version 20021217.Win_Dev (Beta 'caveat utilitor') [FFT v22.7 w/P4] Running N-1 test using base 3 Primality testing 289*2^102150+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 99.99% 289*2^102150+1 is prime! (107.214000 seconds)
modified2003-03-25 11:22:50
created2003-01-05 22:39:48
id63509

Query times: 0.0003 seconds to select prime, 0.0004 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.