9667020265536 + 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:9667020265536 + 1
Verification status (*):Proven
Official Comment (*):Generalized Fermat
Proof-code(s): (*):L4672 : Slade, GFNSvCUDA, GeneFer, AthGFNSieve, PrimeGrid, LLR
Decimal Digits:523325   (log10 is 523324.137543195)
Rank (*):2737 (digit rank is 1)
Entrance Rank (*):2730
Currently on list? (*):yes
Submitted:9/14/2020 08:37:43 CDT
Last modified:9/14/2020 10:50:21 CDT
Database id:131239
Status Flags:TrialDiv
Score (*):44.6451 (normalized score 1.5198)

Archival tags:

There are certain forms classed as archivable: these prime may (at times) remain on this list even if they do not make the Top 5000 proper.  Such primes are tracked with archival tags.
Generalized Fermat (archivable *)
Prime on list: no, rank 381
Subcategory: "Generalized Fermat"
(archival tag id 225661, tag last modified 2020-09-20 06:50:25)

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_id131239
person_id9
machineUsing: Xeon (pool) 4c+4c 3.5GHz
whatprime
notesCommand: /home/caldwell/clientpool/4/pfgw64 -t -q"96670202^65536+1" 2>&1
PFGW Version 4.0.1.64BIT.20191203.x86_Dev [GWNUM 29.8]
Primality testing 96670202^65536+1 [N-1, Brillhart-Lehmer-Selfridge]
Running N-1 test using base 3
Calling Brillhart-Lehmer-Selfridge with factored part 74.05%


96670202^65536+1 is prime! (5997.9842s+0.0052s)
[Elapsed time: 1.67 hours]
modified2020-09-14 10:39:05
created2020-09-14 08:59:07
id176929

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