21257787 - 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:21257787 - 1
Verification status (*):Proven
Official Comment (*):Mersenne 34
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):SG : Slowinski, Gage
Decimal Digits:378632   (log10 is 378631.61515621)
Rank (*):13427 (digit rank is 1)
Entrance Rank (*):1
Currently on list? (*):short
Last modified:9/3/1996
Database id:15
Status Flags:none
Score (*):43.6508 (normalized score 0.453)

Archival tags:

There are certain forms classed as archivable: these prime may (at times) remain on this list even if they do not make the Top 5000 proper.  Such primes are tracked with archival tags.
Mersenne (archivable *)
Prime on list: yes, rank 18
Subcategory: "Mersenne"
(archival tag id 187085, tag last modified 2018-12-21 09:15:32)

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.

Chris Caldwell writes (11 Sep 2014):  (report abuse)
For more information see notes/1257787.html.

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.
machineRedHat P4 P4
notesCommand: /home/caldwell/client/llr.pl 1*2^1257787-1 2>&1 Prime95 or Mprime are much better to test this Mersenne number !! Starting Lucas-Lehmer loop... 1*2^1257787-1 is prime! Time : 2296.437 sec. [Elapsed time: 38.27 minutes]
modified2020-07-07 17:30:39
created2008-08-06 19:23:08

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