# 37 · 2^{6660841} - 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: | 37 · 2^{6660841} - 1 |
---|---|

Verification status (*): | Proven |

Official Comment (*): | [none] |

Unofficial Comments: | This prime has 1 user comment below. |

Proof-code(s): (*): | L3933 : Batalov, PSieve, Srsieve, CRUS, Rieselprime, LLR |

Decimal Digits: | 2005115 (log_{10} is 2005114.5055502) |

Rank (*): | 144 (digit rank is 1) |

Entrance Rank (*): | 25 |

Currently on list? (*): | short |

Submitted: | 7/30/2014 12:23:16 CDT |

Last modified: | 7/30/2014 16:21:34 CDT |

Database id: | 118270 |

Status Flags: | TrialDiv |

Score (*): | 48.7665 (normalized score 79.7786) |

#### 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.

#### 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.

field value prime_id 118270 person_id 9 machine Xeon 4c+4c 3.5GHz what prime notes Command: /home/caldwell/client/llr.pl 37*2^6660841-1 2>&1 Starting Lucas Lehmer Riesel prime test of 37*2^6660841-1 Using AVX FFT length 384K, Pass1=384, Pass2=1K V1 = 4 ; Computing U0... V1 = 4 ; Computing U0...done.Starting Lucas-Lehmer loop... 37*2^6660841-1 is prime! (2005115 decimal digits) Time : 12985.703 sec. [Elapsed time: 3.61 hours] modified 2020-07-07 17:30:17 created 2014-07-30 12:31:01 id 163837

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

Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.