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

Verification status (*): | Proven |

Official Comment (*): | [none] |

Proof-code(s): (*): | L1828 : Benson, PSieve, Srsieve, Rieselprime, LLR |

Decimal Digits: | 900862 (log_{10} is 900861.49104821) |

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

Entrance Rank (*): | 51 |

Currently on list? (*): | short |

Submitted: | 12/4/2011 18:02:25 CDT |

Last modified: | 12/5/2011 00:20:21 CDT |

Database id: | 103453 |

Status Flags: | none |

Score (*): | 46.3126 (normalized score 6.4909) |

#### 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 103453 person_id 9 machine Ditto P4 P4 what trial_divided notes Command: /home/ditto/client/TrialDiv/TrialDiv -q 1095 2 2992587 -1 2>&1 [Elapsed time: 10.913 seconds] modified 2020-07-07 17:30:30 created 2011-12-04 18:05:02 id 136495

field value prime_id 103453 person_id 9 machine Ditto P4 P4 what prime notes Command: /home/ditto/client/llr.pl 1095*2^2992587-1 2>&1 Starting Lucas Lehmer Riesel prime test of 1095*2^2992587-1 Using Irrational Base DWT : Mersenne fftlen = 163840, Used fftlen = 229376 V1 = 5 ; Computing U0... V1 = 5 ; Computing U0...done. Starting Lucas-Lehmer loop... 1095*2^2992587-1 is prime! Time : 21251.820 sec. [Elapsed time: 5.90 hours] modified 2020-07-07 17:30:30 created 2011-12-04 18:08:01 id 136496

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

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