753 · 212050 + 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.
This prime's information:
| Description: | 753 · 212050 + 1 |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | Generalized Cullen |
| Proof-code(s): (*): | D : Dubner, Cruncher |
| Decimal Digits: | 3631 (log10 is 3630.2882427272) |
| Rank (*): | 94177 (digit rank is 1) |
| Entrance Rank (*): | 95 |
| Currently on list? (*): | no |
| Submitted: | 1/1/1990 05:59:59 UTC |
| Last modified: | 3/11/2023 15:54:10 UTC |
| Database id: | 27845 |
| Status Flags: | none |
| Score (*): | 29.2939 (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 Cullen (archivable *)
- Prime on list: no, rank 226
Subcategory: "Generalized Cullen"
(archival tag id 175154, tag last modified 2023-12-29 19:37:13)
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 27845 person_id 9 machine Linux PII 200 what prime notes PFGW Version 1.1 for Pentium and compatibles Running N-1 test using base 5 Primality testing 753*2^12050+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 99.93% 753*2^12050+1 is prime! (14.700000 seconds) modified 2003-03-25 17:26:29 created 2002-12-07 09:16:11 id 25528
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.