1179 · 22158475 + 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:1179 · 22158475 + 1
Verification status (*):Proven
Official Comment (*):Divides GF(2158470,6)
Proof-code(s): (*):L3035 : Scalise, PSieve, Srsieve, PrimeGrid, LLR
Decimal Digits:649769   (log10 is 649768.79140462)
Rank (*):1855 (digit rank is 1)
Entrance Rank (*):306
Currently on list? (*):short
Submitted:7/27/2014 06:44:08 CDT
Last modified:7/27/2014 07:51:30 CDT
Database id:118258
Status Flags:TrialDiv
Score (*):45.3097 (normalized score 2.9077)

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: yes, rank 7, weight 52.3821720596444
Subcategory: "Divides GF(*,6)"
(archival tag id 217769, tag last modified 2020-03-08 07:50:14)

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.
machineXeon 4c+4c 3.5GHz
notesCommand: /home/caldwell/client/pfgw/pfgw64 -t -q"1179*2^2158475+1" 2>&1 PFGW Version [GWNUM 27.11] Primality testing 1179*2^2158475+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 1179*2^2158475+1 is prime! (1835.9441s+0.0010s) [Elapsed time: 30.60 minutes]
modified2020-07-07 17:30:17
created2014-07-27 06:51:03

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