428551 · 22006520 + 1
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
 

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

This prime's information:

field (help)value
Description:428551 · 22006520 + 1
Verification status (*):Proven
Official Comment:
Proof-code(s): (*):g411 : Brittenham, NewPGen, PRP, Proth.exe
Decimal Digits:604029   (log10 is 604028.3389022)
Rank (*):1139 (digit rank is 1)
Entrance Rank (*):87
Currently on list? (*):short
Submitted:4/26/2011 05:15:19 CDT
Last modified:4/26/2011 09:20:20 CDT
Database id:99852
Status Flags:none
Score (*):45.0856 (normalized score 3.8385)

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_id99852
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 428551 2 2006520 1 2>&1
[Elapsed time: 10.286 seconds]
modified2011-12-27 16:48:33
created2011-04-26 05:18:01
id129230

fieldvalue
prime_id99852
person_id9
machineRedHat P4 P4
whatprime
notesCommand: /home/caldwell/client/pfgw -t -q"428551*2^2006520+1" 2>&1
PFGW Version 3.4.5.32BIT.20110215.x86_Dev [GWNUM 26.5]
Primality testing 428551*2^2006520+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%
428551*2^2006520+1 is prime! (13191.9547s+0.0014s)
[Elapsed time: 3.66 hours]
modified2011-05-17 08:18:57
created2011-04-26 05:23:02
id129231

Query times: 0.0005 seconds to select prime, 0.0003 seconds to seek comments.