
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:  4 · 3^{353635}  1 
Verification status (*):  Proven 
Official Comment:  
Proofcode(s): (*):  p228 : Jaworski, Srsieve, PRP, OpenPFGW 
Decimal Digits:  168728 (log_{10} is 168727.37697278) 
Rank (*):  31406 (digit rank is 2) 
Entrance Rank (*):  1073 
Currently on list? (*):  no 
Submitted:  5/30/2008 00:27:56 CDT 
Last modified:  5/30/2008 21:55:22 CDT 
Removed (*):  10/21/2010 08:21:36 CDT 
Database id:  85087 
Status Flags:  none 
Score (*):  41.1651 (normalized score 0.0514) 

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  85087 
person_id  9 
machine  Ditto P4 P4 
what  trial_divided 
notes  Command: /home/ditto/client/TrialDiv/TrialDiv q 4 3 353635 1 2>&1 [Elapsed time: 9.732 seconds]

modified  20111227 16:48:46 
created  20080530 00:35:01 
id  99314 

field  value 
prime_id  85087 
person_id  9 
machine  Ditto P4 P4 
what  prime 
notes  Command: /home/ditto/client/pfgw tp q"4*3^3536351" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 4*3^3536351 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 5, base 1+sqrt(5) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) 1121018 bit request FFT size=(65536,18) Running N+1 test using discriminant 5, base 2+sqrt(5) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) 1121018 bit request FFT size=(65536,18) Running N+1 test using discriminant 5, base 4+sqrt(5) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) 1121018 bit request FFT size=(65536,18) Running N+1 test using discriminant 5, base 5+sqrt(5) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) 1121018 bit request FFT size=(65536,18) Running N+1 test using discriminant 5, base 7+sqrt(5) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) 1121018 bit request FFT size=(65536,18) Running N+1 test using discriminant 5, base 8+sqrt(5) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) 1121018 bit request FFT size=(65536,18) Calling BrillhartLehmerSelfridge with factored part 100.00% 4*3^3536351 is prime! (76640.6714s+0.0362s) [Elapsed time: 21.29 hours]

modified  20080708 09:36:29 
created  20080530 00:38:01 
id  99315 

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