
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:  (20060^{8377}  1)/20059 
Verification status (*):  PRP 
Official Comment:  Generalized repunit 
Unofficial Comments:  This prime has 1 user comment below. 
Proofcode(s): (*):  c67 : Batalov, NewPGen, OpenPFGW, Primo 
Decimal Digits:  36037 (log_{10} is 36036.323880311) 
Rank (*):  55621 (digit rank is 1) 
Entrance Rank (*):  52302 
Currently on list? (*):  short 
Submitted:  4/30/2015 17:51:14 CDT 
Last modified:  4/30/2015 18:20:34 CDT 
Database id:  119832 
Status Flags:  Verify, TrialDiv 
Score (*):  36.406 (normalized score 0.0006) 

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.
 Generalized Repunit (archivable *)
 Prime on list: yes, rank 18
Subcategory: "Generalized Repunit"
(archival tag id 217999, tag last modified 20170204 08:50:35)
User comments about this prime (disclaimer):
User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.
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  119832 
person_id  9 
machine  Using: Xeon 4c+4c 3.5GHz 
what  prp 
notes  Command: /home/caldwell/client/pfgw/pfgw64 tc q"(20060^83771)/20059" 2>&1 PFGW Version 3.7.7.64BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing (20060^83771)/20059 [N1/N+1, BrillhartLehmerSelfridge] Running N1 test using base 2 Running N+1 test using discriminant 11, base 1+sqrt(11) Calling N1 BLS with factored part 0.19% and helper 0.03% (0.60% proof)
(20060^83771)/20059 is Fermat and Lucas PRP! (95.3362s+0.0008s) [Elapsed time: 1.60 minutes]

modified  20150507 06:34:53 
created  20150430 18:01:01 
id  165452 

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