59056921173 · 234030 + 7

At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important PrimePages database: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.

Description:59056921173 · 234030 + 7
Verification status (*):PRP
Official Comment (*):ECPP
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):FE6 : Jordan, Morain, LLR, FastECPP
Decimal Digits:10255   (log10 is 10254.822023247)
Rank (*):77178 (digit rank is 1)
Entrance Rank (*):40408
Currently on list? (*):no
Submitted:3/26/2009 21:09:52 CDT
Last modified:3/26/2009 21:50:20 CDT
Database id:87280
Status Flags:Verify
Score (*):32.5181 (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.
Elliptic Curve Primality Proof (archivable *)
Prime on list: no, rank 202
Subcategory: "ECPP"
(archival tag id 208956, tag last modified 2021-06-05 07:37:29)

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.

Chris Caldwell writes (11 Sep 2014):  (report abuse)
Certificate.

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.
fieldvalue
prime_id87280
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 59056921173 2 34030 7 2>&1 [Elapsed time: 8.273 seconds]
modified2020-07-07 17:30:38
created2009-03-26 21:18:01
id103923

fieldvalue
prime_id87280
person_id9
machineRedHat P4 P4
whatprp
notesCommand: /home/caldwell/client/pfgw -tc -q"59056921173*2^34030+7" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 59056921173*2^34030+7 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 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) 68140 bit request FFT size=(4096,17) Running N-1 test using base 11 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) 68140 bit request FFT size=(4096,17) Running N+1 test using discriminant 23, base 2+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) 68148 bit request FFT size=(4096,17) Calling N-1 BLS with factored part 0.08% and helper 0.01% (0.24% proof) 59056921173*2^34030+7 is Fermat and Lucas PRP! (54.2500s+0.0000s) [Elapsed time: 55.00 seconds]
modified2020-07-07 17:30:38
created2009-03-26 21:23:01
id103924

Query times: 0.0004 seconds to select prime, 0.0008 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.