1323 · 21064161 + 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: | 1323 · 21064161 + 1 |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | [none] |
| Proof-code(s): (*): | L3415 : Johnston1, PSieve, Srsieve, PrimeGrid, LLR |
| Decimal Digits: | 320348 (log10 is 320347.50277562) |
| Rank (*): | 23474 (digit rank is 1) |
| Entrance Rank (*): | 2281 |
| Currently on list? (*): | no |
| Submitted: | 3/2/2013 13:09:49 UTC |
| Last modified: | 3/11/2023 15:54:10 UTC |
| Removed (*): | 11/26/2013 20:49:16 UTC |
| Database id: | 111430 |
| Status Flags: | none |
| Score (*): | 43.1371 (normalized score 0.1021) |
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 111430 person_id 9 machine Ditto P4 P4 what trial_divided notes Command: /home/ditto/client/TrialDiv/TrialDiv -q 1323 2 1064161 1 2>&1 [Elapsed time: 9.883 seconds] modified 2020-07-07 22:30:22 created 2013-03-02 13:43:55 id 153163
field value prime_id 111430 person_id 9 machine Ditto P4 P4 what prime notes Command: /home/ditto/client/pfgw -t -q"1323*2^1064161+1" 2>&1 PFGW Version 3.4.5.32BIT.20110215.x86_Dev [GWNUM 26.5] Primality testing 1323*2^1064161+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 1323*2^1064161+1 is prime! (3241.2297s+0.0009s) [Elapsed time: 54.02 minutes] modified 2020-07-07 22:30:22 created 2013-03-02 14:33:21 id 153180
Query times: 0.0003 seconds to select prime, 0.0004 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.