
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 · 10^{19233}  1 
Verification status (*):  Proven 
Official Comment:  Nearrepdigit 
Proofcode(s): (*):  g200 : Clarkson, Proth.exe 
Decimal Digits:  19234 (log_{10} is 19233.3010299957) 
Rank (*):  64871 (digit rank is 1) 
Entrance Rank (*):  2831 
Currently on list? (*):  no 
Submitted:  9/21/2000 17:22:27 CDT 
Last modified:  9/21/2000 17:22:27 CDT 
Database id:  9814 
Status Flags:  none 
Score (*):  34.4653 (normalized score 0) 

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.
 Nearrepdigit (archivable *)
 Prime on list: no, rank 171
Subcategory: "Nearrepdigit"
(archival tag id 211141, tag last modified 20160919 13:50:12)
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  9814 
person_id  9 
machine  Windows XP P4 1.8GHz 
what  prime 
notes  Primality testing 2*10^192331 [N+1, BrillhartLehmerSelfridge] Calling BrillhartLehmerSelfridge with factored part 69.90% 2*10^192331 is prime! (950.529000 seconds) PFGW Version 1.1 for Windows Running N+1 test using discriminant 3, base 1+sqrt(3) Running N+1 test using discriminant 3, base 3+sqrt(3) Running N+1 test using discriminant 3, base 6+sqrt(3) 
modified  20030325 11:25:02 
created  20021212 16:48:31 
id  39160 

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