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

Verification status (*): | Proven |

Official Comment (*): | Generalized Woodall |

Proof-code(s): (*): | g2 : Lifchitz, Proth.exe |

Decimal Digits: | 1208 (log_{10} is 1207.4210126516) |

Rank (*): | 112575 (digit rank is 32) |

Entrance Rank (*): | 24758 |

Currently on list? (*): | no |

Submitted: | 7/3/1998 08:17:40 CDT |

Last modified: | 7/3/1998 08:17:40 CDT |

Database id: | 46892 |

Status Flags: | none |

Score (*): | 25.8615 (normalized score 0) |

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

- Generalized Woodall (archivable *)
- Prime on list:
no, rank338

Subcategory: "Generalized Woodall"

(archival tag id 186983, tag last modified 2019-11-26 12:20:12)

#### 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 46892 person_id 9 machine Linux PII 200 what prime notes PFGW Version 1.1 for Pentium and compatibles Running N+1 test using discriminant 3, base 1+sqrt(3) Primality testing 125*2^4004-1 [N+1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 99.85% 125*2^4004-1 is prime! (3.600000 seconds) modified 2003-03-25 11:26:43 created 2002-12-06 13:08:14 id 23442

Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.

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