43 · 22795582 + 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:43 · 22795582 + 1
Verification status (*):Proven
Official Comment (*):[none]
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):L2842 : English1, PSieve, Srsieve, PrimeGrid, LLR
Decimal Digits:841556   (log10 is 841555.67080676)
Rank (*):1689 (digit rank is 1)
Entrance Rank (*):96
Currently on list? (*):short
Submitted:5/3/2013 05:01:36 CDT
Last modified:5/3/2013 11:01:14 CDT
Database id:114042
Status Flags:none
Score (*):46.1036 (normalized score 5.1854)

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.

Ryan English writes (11 Sep 2014):  (report abuse)
Divides xGF(2795579,12,7)!!!!

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.
machineDitto P4 P4
notesCommand: /home/ditto/client/TrialDiv/TrialDiv -q 43 2 2795582 1 2>&1 [Elapsed time: 10.818 seconds]
modified2020-07-07 17:30:19
created2013-05-03 05:05:21

machineRedHat P4 P4
notesCommand: /home/caldwell/client/pfgw -t -q"43*2^2795582+1" 2>&1 PFGW Version [GWNUM 26.5] Primality testing 43*2^2795582+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 3 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 43*2^2795582+1 is prime! (18852.5331s+0.0028s) [Elapsed time: 5.24 hours]
modified2020-07-07 17:30:19
created2013-05-03 05:23:01

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