35 · 2494607 + 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:35 · 2494607 + 1
Verification status (*):Proven
Official Comment (*):[none]
Proof-code(s): (*):g220 : Keiser, Proth.exe
Decimal Digits:148894   (log10 is 148893.08713342)
Rank (*):38024 (digit rank is 1)
Entrance Rank (*):309
Currently on list? (*):no
Submitted:5/3/2005 12:51:12 CDT
Last modified:5/3/2005 12:51:12 CDT
Removed (*):3/31/2010 01:39:31 CDT
Database id:74374
Status Flags:none
Score (*):40.7801 (normalized score 0.0211)

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.
machineLinux P4 2.8GHz
notesCommand: /home/caldwell/client/pfgw -f -t -q"35*2^494607+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 35*2^494607+1 [N-1, Brillhart-Lehmer-Selfridge] trial factoring to 52133146 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) Reduced from FFT(65536,17) to FFT(65536,16) 989234 bit request FFT size=(65536,16) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 35*2^494607+1 is prime! (-2063.5173s+0.0000s)
modified2020-07-07 17:30:43
created2005-05-03 12:53:00

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