16647973785 · 2333333 - 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: | 16647973785 · 2333333 - 1 |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | [none] |
| Proof-code(s): (*): | L269 : Courty, NewPGen, PrimeGrid, TPS, LLR |
| Decimal Digits: | 100354 (log10 is 100353.45290605) |
| Rank (*): | 44715 (digit rank is 1759) |
| Entrance Rank (*): | 3596 |
| Currently on list? (*): | no |
| Submitted: | 7/3/2007 11:27:46 CDT |
| Last modified: | 7/3/2007 12:20:58 CDT |
| Removed (*): | 11/22/2007 00:37:22 CDT |
| Database id: | 81548 |
| Status Flags: | none |
| Score (*): | 39.5651 (normalized score 0.0083) |
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 81548 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/TrialDiv/TrialDiv -q 16647973785 2 333333 -1 2>&1 [Elapsed time: 9.996 seconds] modified 2020-07-07 17:30:41 created 2007-07-03 11:52:11 id 92200
field value prime_id 81548 person_id 9 machine RedHat P4 P4 what prime notes Command: /home/caldwell/client/llr.pl 16647973785*2^333333-1 2>&1 Starting Lucas Lehmer Riesel prime test of 16647973785*2^333333-1 V1 = 5 ; Computing U0... Done Computing U0. Starting Lucas-Lehmer loop... 16647973785*2^333333-1 is prime! Time: 1299.615 sec. [Elapsed time: 1300 seconds] modified 2020-07-07 17:30:41 created 2007-07-03 11:59:18 id 92201
Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.