113983 · 23201175 - 1
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
 

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:113983 · 23201175 - 1
Verification status (*):Proven
Official Comment:
Proof-code(s): (*):L613 : Keogh, Srsieve, ProthSieve, RieselSieve, LLR
Decimal Digits:963655   (log10 is 963654.75320973)
Rank (*):331 (digit rank is 1)
Entrance Rank (*):19
Currently on list? (*):short
Submitted:5/1/2008 16:20:26 CDT
Last modified:5/2/2008 01:44:23 CDT
Database id:84913
Status Flags:none
Score (*):46.5194 (normalized score 15.8268)

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_id84913
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 113983 2 3201175 -1 2>&1
[Elapsed time: 10.814 seconds]
modified2011-12-27 16:48:47
created2008-05-01 16:22:02
id98952

fieldvalue
prime_id84913
person_id9
machineRedHat P4 P4
whatprime
notesCommand: /home/caldwell/client/llr.pl 113983*2^3201175-1 2>&1
Starting Lucas Lehmer Riesel prime test of 113983*2^3201175-1
Using Irrational Base DWT : Mersenne fftlen = 163840, Used fftlen = 327680
V1 = 4 ; Computing U0...
V1 = 4 ; Computing U0...done.
Starting Lucas-Lehmer loop...
*2^3201175-1 is prime! Time : 33682.030 sec.
[Elapsed time: 9.36 hours]
modified2008-05-25 22:31:35
created2008-05-01 16:23:01
id98953

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