2 · 8299282992 + 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:2 · 8299282992 + 1
Verification status (*):Proven
Official Comment (*):[none]
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):p402 : Batalov, MultiSieve, OpenPFGW
Decimal Digits:408241   (log10 is 408240.95588406)
Rank (*):13493 (digit rank is 1)
Entrance Rank (*):4668
Currently on list? (*):no
Submitted:4/8/2018 15:58:36 UTC
Last modified:5/20/2023 20:59:19 UTC
Removed (*):9/14/2018 02:17:25 UTC
Database id:124574
Status Flags:none
Score (*):43.8822 (normalized score 0.3378)

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.

Serge Batalov writes (8 Apr 2018):  (report abuse)
Extends A110932 OEIS series.

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_id124574
person_id9
machineUsing: Xeon 4c+4c 3.5GHz
whatprime
notesCommand: /home/caldwell/client/pfgw/pfgw64 -t -q"2*82992^82992+1" 2>&1 PFGW Version 3.7.7.64BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing 2*82992^82992+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Running N-1 test using base 11 Calling Brillhart-Lehmer-Selfridge with factored part 50.47% 2*82992^82992+1 is prime! (7106.9227s+0.0095s) [Elapsed time: 1.97 hours]
modified2020-07-07 22:30:15
created2018-04-08 16:01:02
id170239

Query times: 0.0003 seconds to select prime, 0.0005 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.