1771 · 2527964 + 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.

Description:1771 · 2527964 + 1
Verification status (*):Proven
Official Comment (*):[none]
Proof-code(s): (*):L1414 : Drews, PSieve, Srsieve, PrimeGrid, LLR
Decimal Digits:158937   (log10 is 158936.2488493)
Rank (*):35098 (digit rank is 1)
Entrance Rank (*):4669
Currently on list? (*):no
Submitted:7/22/2010 16:49:42 CDT
Last modified:7/22/2010 17:50:32 CDT
Removed (*):8/8/2010 02:29:58 CDT
Database id:93671
Status Flags:none
Score (*):40.9811 (normalized score 0.0309)

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.
machineRedHat P4 P4
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 1771 2 527964 1 2>&1 [Elapsed time: 9.744 seconds]
modified2020-07-07 17:30:34
created2010-07-22 16:52:11

machineDitto P4 P4
notesCommand: /home/ditto/client/pfgw -t -q"1771*2^527964+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 1771*2^527964+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(65536,20) to FFT(65536,19) Reduced from FFT(65536,19) to FFT(65536,18) Reduced from FFT(65536,18) to FFT(65536,17) 1055958 bit request FFT size=(65536,17) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 1771*2^527964+1 is prime! (1454.3300s+0.0000s) [Elapsed time: 24.55 minutes]
modified2020-07-07 17:30:34
created2010-07-22 17:08:01

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