
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:  9 · 10^{364521}  1 
Verification status (*):  Proven 
Official Comment:  Nearrepdigit 
Proofcode(s): (*):  p297 : Broadhurst, Srsieve, NewPGen, LLR, OpenPFGW 
Decimal Digits:  364522 (log_{10} is 364521.95424251) 
Rank (*):  9384 (digit rank is 1) 
Entrance Rank (*):  261 
Currently on list? (*):  short 
Submitted:  12/19/2010 13:58:12 CDT 
Last modified:  12/20/2010 10:20:23 CDT 
Database id:  97025 
Status Flags:  none 
Score (*):  43.5341 (normalized score 0.8183) 

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: yes, rank 19
Subcategory: "Nearrepdigit"
(archival tag id 213028, 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  97025 
person_id  9 
machine  Ditto P4 P4 
what  trial_divided 
notes  Command: /home/ditto/client/TrialDiv/TrialDiv q 9 10 364521 1 2>&1 [Elapsed time: 9.517 seconds]

modified  20111227 16:48:35 
created  20101219 14:05:02 
id  123440 

field  value 
prime_id  97025 
person_id  9 
machine  Ditto P4 P4 
what  prime 
notes  Command: /home/ditto/client/pfgw tp q"9*10^3645211" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 9*10^3645211 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 7, base 1+sqrt(7) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(163840,20) to FFT(163840,19) Reduced from FFT(163840,19) to FFT(163840,18) Reduced from FFT(163840,18) to FFT(163840,17) Reduced from FFT(163840,17) to FFT(163840,16) 2421848 bit request FFT size=(163840,16) Calling BrillhartLehmerSelfridge with factored part 69.90% 9*10^3645211 is prime! (841.7440s+0.0700s) [Elapsed time: 20.17 hours]

modified  20110118 10:15:30 
created  20101219 14:08:02 
id  123441 

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