To be removed soon:   language help

6659 · 21453227 + 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:6659 · 21453227 + 1
Verification status (*):Proven
Official Comment (*):[none]
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):L4396 : Goforth, PSieve, Srsieve, PrimeGrid, LLR
Decimal Digits:437469   (log10 is 437468.740917795)
Rank (*):5637 (digit rank is 1)
Entrance Rank (*):2606
Currently on list? (*):no
Submitted:7/18/2017 11:37:46 CDT
Last modified:7/18/2017 12:20:18 CDT
Removed (*):2/2/2020 19:29:07 CDT
Database id:123761
Status Flags:TrialDiv
Score (*):44.0946 (normalized score 0.9073)

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.

PrimeGrid writes (18 Jul 2017):  (report abuse)
Divides xGF(1453225,12,5)

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_id123761
person_id9
machineUsing: Xeon 4c+4c 3.5GHz
whatprime
notesCommand: /home/caldwell/client/pfgw/pfgw64 -t -q"6659*2^1453227+1" 2>&1 PFGW Version 3.7.7.64BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing 6659*2^1453227+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 6659*2^1453227+1 is prime! (989.4362s+0.0007s) [Elapsed time: 16.50 minutes]
modified2020-07-07 17:30:15
created2017-07-18 11:41:01
id169413

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