15 · 1056021 + 1

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.

This prime's information:

Description:15 · 1056021 + 1
Verification status (*):Proven
Official Comment (*):[none]
Proof-code(s): (*):p67 : Benson, NewPGen, OpenPFGW
Decimal Digits:56023   (log10 is 56022.176091259)
Rank (*):59448 (digit rank is 1)
Entrance Rank (*):2685
Currently on list? (*):no
Submitted:7/4/2004 22:02:45 UTC
Last modified:3/11/2023 15:54:10 UTC
Removed (*):4/4/2005 08:37:03 UTC
Database id:70887
Status Flags:none
Score (*):37.7679 (normalized score 0.0006)

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_id70887
person_id9
machineLinux P4 2.8GHz
whatprime
notesCommand: /home/caldwell/client/pfgw -f -t -q"15*10^56021+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 15*10^56021+1 [N-1, Brillhart-Lehmer-Selfridge] trial factoring to 18342070 Running N-1 test using base 7 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(24576,20) to FFT(24576,19) Reduced from FFT(24576,19) to FFT(24576,18) Reduced from FFT(24576,18) to FFT(24576,17) Reduced from FFT(24576,17) to FFT(24576,16) 372212 bit request FFT size=(24576,16) Calling Brillhart-Lehmer-Selfridge with factored part 69.90% 15*10^56021+1 is prime! (1281.7025s+0.0048s)
modified2020-07-07 22:30:45
created2004-07-05 03:25:36
id75862

Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.