9 · 239186 + 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 · 239186 + 1
Verification status (*):Proven
Official Comment (*):Divides GF(39177,3), generalized Fermat
Proof-code(s): (*):D : Dubner, Cruncher
Decimal Digits:11798   (log10 is 11797.115652598)
Rank (*):77608 (digit rank is 1)
Entrance Rank (*):25
Currently on list? (*):no
Submitted:1992
Last modified:1992
Database id:16396
Status Flags:none
Score (*):32.9522 (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 65, weight 35.149485591379
Subcategory: "Divides GF(*,3)"
(archival tag id 193984, tag last modified 2021-02-26 11:20:20)
Generalized Fermat (archivable *)
Prime on list: no, rank 6230
Subcategory: "Generalized Fermat"
(archival tag id 208423, tag last modified 2022-07-03 08:50:15)

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_id16396
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^39186+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 99.99% 9*2^39186+1 is prime! (188.810000 seconds)
modified2003-03-25 11:24:47
created2002-12-15 20:08:02
id42603

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