To be removed soon:   language help

865687087545 · 2666670 - 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:865687087545 · 2666670 - 1
Verification status (*):Proven
Official Comment (*):[none]
Proof-code(s): (*):L2152 : Aoyama, TwinGen, PrimeGrid, LLR
Decimal Digits:200700   (log10 is 200699.60457025)
Rank (*):26306 (digit rank is 1364)
Entrance Rank (*):2894
Currently on list? (*):no
Submitted:2/12/2011 21:09:47 CDT
Last modified:2/13/2011 00:50:24 CDT
Removed (*):8/31/2011 08:10:05 CDT
Database id:98357
Status Flags:none
Score (*):41.699 (normalized score 0.0827)

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_id98357
person_id9
machineRedHat P4 P4
whattrial_divided
notesCommand: /home/caldwell/client/TrialDiv/TrialDiv -q 865687087545 2 666670 -1 2>&1
[Elapsed time: 10.004 seconds]
modified2011-12-27 16:48:34
created2011-02-12 21:18:01
id126078

fieldvalue
prime_id98357
person_id9
machineRedHat Virtual STEM Server
whatprime
notesCommand: /home/caldwell/client/llr.pl 865687087545*2^666670-1 2>&1
Starting Lucas Lehmer Riesel prime test of 865687087545*2^666670-1
Using Zero Padded IBDWT : Mersenne fftlen = 32768, Used fftlen = 81920
V1 = 9 ; Computing U0...
V1 = 9 ; Computing U0...done.Starting Lucas-Lehmer loop...


865687087545*2^666670-1 is prime! Time : 1113.368 sec.
[Elapsed time: 19.03 minutes]
modified2011-03-25 10:27:30
created2011-02-13 00:22:48
id126100

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