2601 · 2533227 + 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:2601 · 2533227 + 1
Verification status (*):Proven
Official Comment (*):[none]
Proof-code(s): (*):L1229 : Gordon1, PSieve, Srsieve, PrimeGrid, LLR
Decimal Digits:160521   (log10 is 160520.73663827)
Rank (*):36319 (digit rank is 1)
Entrance Rank (*):4563
Currently on list? (*):no
Submitted:7/27/2010 16:12:55 CDT
Last modified:7/27/2010 17:50:21 CDT
Removed (*):8/19/2010 12:21:30 CDT
Database id:93785
Status Flags:none
Score (*):41.0116 (normalized score 0.0261)

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_id93785
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 2601 2 533227 1 2>&1 [Elapsed time: 9.549 seconds]
modified2020-07-07 17:30:34
created2010-07-27 16:18:02
id116942

fieldvalue
prime_id93785
person_id9
machineWinXP Dual Core 2.6GHz Laptop
whatprime
notesCommand: pfgw.exe -n -t -q"2601*2^533227+1" 2>&1 PFGW Version 20030811.Win_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Running N-1 test using base 19 N-1: 2601*2^5Primality testing 2601*2^533227+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 2601*2^533227+1 is prime! (970.8926s+0.0050s) 33227+1[Elapsed time: 971 seconds]
modified2020-07-07 17:30:34
created2010-07-27 17:28:03
id116961

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