485767 · 23609357 - 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:485767 · 23609357 - 1
Verification status (*):Proven
Official Comment:
Proof-code(s): (*):L622 : Cardall, Srsieve, ProthSieve, RieselSieve, LLR
Decimal Digits:1086531   (log10 is 1086530.40848777)
Rank (*):164 (digit rank is 1)
Entrance Rank (*):17
Currently on list? (*):short
Submitted:6/24/2008 22:34:48 CDT
Last modified:6/25/2008 13:01:52 CDT
Database id:85221
Status Flags:none
Score (*):46.8876 (normalized score 22.8419)

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_id85221
person_id9
machineDitto P4 P4
whattrial_divided
notesCommand: /home/ditto/client/TrialDiv/TrialDiv -q 485767 2 3609357 -1 2>&1
[Elapsed time: 10.905 seconds]
modified2011-12-27 16:48:46
created2008-06-24 22:35:01
id99703

fieldvalue
prime_id85221
person_id9
machineDitto P4 P4
whatprime
notesCommand: /home/ditto/client/llr.pl 485767*2^3609357-1 2>&1
Starting Lucas Lehmer Riesel prime test of 485767*2^3609357-1
Using Zero Padded IBDWT : Mersenne fftlen = 196608, Used fftlen = 393216
V1 = 4 ; Computing U0...
V1 = 4 ; Computing U0...done.
Starting Lucas-Lehmer loop...

485767*2^3609357-1 is prime! Time : 51829.334 sec.
[Elapsed time: 14.40 hours]
modified2008-07-08 09:36:29
created2008-06-24 22:38:02
id99704

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