
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:  (2^{695631}  1)^{2}  2 
Verification status (*):  Proven 
Official Comment:  
Proofcode(s): (*):  p393 : Rodenkirch, Cksieve, OpenPFGW 
Decimal Digits:  418812 (log_{10} is 418811.593827461) 
Rank (*):  4350 (digit rank is 1) 
Entrance Rank (*):  2586 
Currently on list? (*):  yes 
Submitted:  7/16/2016 21:08:25 CDT 
Last modified:  7/17/2016 06:20:28 CDT 
Database id:  121905 
Status Flags:  TrialDiv 
Score (*):  43.9607 (normalized score 1.0992) 

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.
field  value 
prime_id  121905 
person_id  9 
machine  Using: Xeon 4c+4c 3.5GHz 
what  prime 
notes  Command: /home/caldwell/client/pfgw/pfgw64 tc q"(2^6956311)^22" 2>&1 PFGW Version 3.7.7.64BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing (2^6956311)^22 [N1/N+1, BrillhartLehmerSelfridge] Running N1 test using base 5 Running N+1 test using discriminant 13, base 1+sqrt(13) Running N+1 test using discriminant 13, base 2+sqrt(13) Calling N+1 BLS with factored part 50.01% and helper 0.00% (150.03% proof)
(2^6956311)^22 is prime! (32695.2575s+0.0082s) [Elapsed time: 9.08 hours]

modified  20170127 05:57:11 
created  20160716 21:11:01 
id  167544 

Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.
