7 · 23015762 + 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:7 · 23015762 + 1
Verification status (*):Proven
Official Comment (*):[none]
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):g279 : Cooper, NewPGen, PRP, Proth.exe
Decimal Digits:907836   (log10 is 907835.66688164)
Rank (*):912 (digit rank is 1)
Entrance Rank (*):18
Currently on list? (*):short
Submitted:1/30/2008 21:50:43 CDT
Last modified:1/31/2008 19:27:15 CDT
Database id:83806
Status Flags:none
Score (*):46.3363 (normalized score 8.2526)

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.

Curtis Cooper writes (11 Sep 2014):  (report abuse)
7*2^3015762+1 is a Factor of xGF(3015759,5,2)
7*2^3015762+1 is a Factor of xGF(3015761,8,3)
7*2^3015762+1 is a Factor of xGF(3015760,9,7)
7*2^3015762+1 is a Factor of xGF(3015759,12,11)

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_id83806
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 7 2 3015762 1 2>&1 [Elapsed time: 10.635 seconds]
modified2020-07-07 17:30:40
created2008-01-30 21:52:02
id96743

fieldvalue
prime_id83806
person_id9
machineRedHat P4 P4
whatprime
notesCommand: /home/caldwell/client/pfgw -t -q"7*2^3015762+1" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 7*2^3015762+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(393216,19) to FFT(393216,18) Reduced from FFT(393216,18) to FFT(393216,17) Reduced from FFT(393216,17) to FFT(393216,16) 6031538 bit request FFT size=(393216,16) Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 7*2^3015762+1 is prime! (-2012.3313s+0.0000s) [Elapsed time: 21.57 hours]
modified2020-07-07 17:30:40
created2008-01-30 21:53:02
id96744

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