143 · 22007888 - 1
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
GIMPS has discovered a new largest known prime number: 282589933-1 (24,862,048 digits)

At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important databases at The Prime Pages: a collection of research, records and results all about prime numbers. This page summarizes our information about one of these primes.

This prime's information:

field (help)value
Description:143 · 22007888 - 1
Verification status (*):Proven
Official Comment:
Proof-code(s): (*):L384 : Pinho, Srsieve, Rieselprime, LLR
Decimal Digits:604437   (log10 is 604436.671269797)
Rank (*):1683 (digit rank is 1)
Entrance Rank (*):815
Currently on list? (*):short
Submitted:4/9/2016 01:34:07 CDT
Last modified:4/9/2016 03:20:08 CDT
Database id:121532
Status Flags:TrialDiv
Score (*):45.0876 (normalized score 2.8601)

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.
machineUsing: Xeon (pool) 4c+4c 3.5GHz
notesCommand: /home/caldwell/clientpool/1/pfgw64 -tp -q"143*2^2007888-1" 2>&1
PFGW Version [GWNUM 27.11]
Primality testing 143*2^2007888-1 [N+1, Brillhart-Lehmer-Selfridge]
Running N+1 test using discriminant 3, base 1+sqrt(3)
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 18/2007897 ERROR: ROUND OFF 0.48906>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 3, base 1+sqrt(3)
Calling Brillhart-Lehmer-Selfridge with factored part 100.00%

143*2^2007888-1 is prime! (4389.9062s+0.0008s)
[Elapsed time: 73.17 minutes]
modified2017-01-27 05:57:12
created2016-04-09 01:43:01

Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.