
The nth Prime Page will now find any of the first 2,623,557,157,654,233 primes or
π( x) for x up to 100,000,000,000,000,000.
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:  (U(11987, 1, 2521)  U(11987, 1, 2520))/(U(11987, 1, 36)  U(11987, 1, 35)) 
Verification status (*):  PRP 
Official Comment:  Lehmer primitive part 
Unofficial Comments:  This prime has 2 user comments below. 
Proofcode(s): (*):  x38 : Broadhurst, Primo, OpenPFGW 
Decimal Digits:  10136 (log_{10} is 10135.59559823) 
Rank (*):  70796 (digit rank is 1) 
Entrance Rank (*):  41174 
Currently on list? (*):  no 
Submitted:  5/2/2009 20:29:25 CDT 
Last modified:  5/2/2009 20:50:26 CDT 
Database id:  88002 
Status Flags:  Verify 
Score (*):  32.4818 (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.
 Lehmer primitive part (archivable *)
 Prime on list: no, rank 43
Subcategory: "Lehmer primitive part"
(archival tag id 208993, tag last modified 20160614 19:50:41)
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  88002 
person_id  9 
machine  Ditto P4 P4 
what  trial_divided 
notes  Command: /home/ditto/client/pfgw o f q"(lucasU(11987,1,2521)lucasU(11987,1,2520))/(lucasU(11987,1,36)lucasU(11987,1,35))" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] (lucasU(11987,1,2521)luc.........1,36)lucasU(119 1/1
trial factoring to 2915469 (lucasU(11987,1,2521)lucasU(11987,1,2520))/(lucasU(11987,1,36)lucasU(11987,1,35)) has no small factor. [Elapsed time: 2.701 seconds]

modified  20111227 16:48:44 
created  20090502 20:35:01 
id  105362 

field  value 
prime_id  88002 
person_id  9 
machine  Ditto P4 P4 
what  prp 
notes  Command: /home/ditto/client/pfgw tc q"(lucasU(11987,1,2521)lucasU(11987,1,2520))/(lucasU(11987,1,36)lucasU(11987,1,35))" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing (lucasU(11987,1,2521)lucasU(11987,1,2520))/(lucasU(11987,1,36)lucasU(11987,1,35)) [N1/N+1, BrillhartLehmerSelfridge] Running N1 test using base 7 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(4096,21) to FFT(4096,20) Reduced from FFT(4096,20) to FFT(4096,19) Reduced from FFT(4096,19) to FFT(4096,18) Reduced from FFT(4096,18) to FFT(4096,17) 67348 bit request FFT size=(4096,17) Running N+1 test using discriminant 23, base 1+sqrt(23) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(4096,21) to FFT(4096,20) Reduced from FFT(4096,20) to FFT(4096,19) Reduced from FFT(4096,19) to FFT(4096,18) Reduced from FFT(4096,18) to FFT(4096,17) 67356 bit request FFT size=(4096,17) Calling N1 BLS with factored part 1.00% and helper 0.27% (3.28% proof) (lucasU(11987,1,2521)lucasU(11987,1,2520))/(lucasU(11987,1,36)lucasU(11987,1,35)) is Fermat and Lucas PRP! (46.3300s+0.0100s) [Elapsed time: 47.00 seconds]

modified  20090525 07:25:56 
created  20090502 20:38:02 
id  105363 

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