9 · 23690 + 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:9 · 23690 + 1
Verification status (*):Proven
Official Comment (*):Generalized Fermat; divides GF(3684,3) [BR]
Proof-code(s): (*):CW : Cormack
Decimal Digits:1112   (log10 is 1111.7549265095)
Rank (*):118929 (digit rank is 20)
Entrance Rank (*):11
Currently on list? (*):no
Submitted:1979
Last modified:8/30/2007 13:50:03 CDT
Database id:51936
Status Flags:none
Score (*):25.6034 (normalized score 0)

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 Divisors (bases 3,5,6,10,12) (archivable *)
Prime on list: no, rank 93, weight 27.80063109535
Subcategory: "Divides GF(*,3)"
(archival tag id 185851, tag last modified 2021-02-26 11:20:20)
Generalized Fermat (archivable *)
Prime on list: no, rank 6670
Subcategory: "Generalized Fermat"
(archival tag id 208863, tag last modified 2022-07-03 08:50:16)

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_id51936
person_id9
machineLinux PII 200
whatprime
notesPFGW Version 1.1 for Pentium and compatibles Running N-1 test using base 5 Primality testing 9*2^3690+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 99.92% 9*2^3690+1 is prime! (1.230000 seconds)
modified2020-07-07 17:30:56
created2002-12-04 23:07:41
id8455

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