(217683 - 1)/14570261281140293911854048050469358706809858630769
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: | (217683 - 1)/14570261281140293911854048050469358706809858630769 |
|---|---|
| Verification status (*): | PRP |
| Official Comment (*): | Mersenne cofactor, ECPP |
| Unofficial Comments: | This prime has 1 user comment below. |
| Proof-code(s): (*): | c4 : Broadhurst, Primo |
| Decimal Digits: | 5274 (log10 is 5273.9499459863) |
| Rank (*): | 90460 (digit rank is 1) |
| Entrance Rank (*): | 50150 |
| Currently on list? (*): | no |
| Submitted: | 9/25/2009 02:47:00 UTC |
| Last modified: | 3/11/2023 15:54:10 UTC |
| Database id: | 90105 |
| Status Flags: | Verify |
| Score (*): | 30.4548 (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.
- Elliptic Curve Primality Proof (archivable *)
- Prime on list: no, rank 544
Subcategory: "ECPP"
(archival tag id 210521, tag last modified 2024-04-19 02:37:11)- Mersenne cofactor (archivable *)
- Prime on list: no, rank 33
Subcategory: "Mersenne cofactor"
(archival tag id 210522, tag last modified 2024-04-11 03:37:12)
User comments about this prime (disclaimer):
User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.
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 90105 person_id 9 machine RedHat P4 P4 what trial_divided notes Command: /home/caldwell/client/pfgw -o -f -q"(2^17683-1)/(234000819833373807217*62265855698776681155719328257)" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] (2^17683-1)/(234000819833.........8556987766811557 1/1 trial factoring to 1436897 (2^17683-1)/(2340008198...3373807217*6226585569...5719328257) has no small factor. [Elapsed time: 0.735 seconds] modified 2020-07-07 22:30:37 created 2009-09-25 02:48:01 id 109585
field value prime_id 90105 person_id 9 machine RedHat P4 P4 what prp notes Command: /home/caldwell/client/pfgw -tc -q"(2^17683-1)/(234000819833373807217*62265855698776681155719328257)" 2>&1 PFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing (2^17683-1)/(2340008198...3373807217*6226585569...5719328257) [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(2048,21) to FFT(2048,20) Reduced from FFT(2048,20) to FFT(2048,19) Reduced from FFT(2048,19) to FFT(2048,18) 35048 bit request FFT size=(2048,18) Running N+1 test using discriminant 13, base 1+sqrt(13) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(2048,21) to FFT(2048,20) Reduced from FFT(2048,20) to FFT(2048,19) Reduced from FFT(2048,19) to FFT(2048,18) 35056 bit request FFT size=(2048,18) Calling N-1 BLS with factored part 0.15% and helper 0.07% (0.53% proof) (2^17683-1)/(2340008198...3373807217*6226585569...5719328257) is Fermat and Lucas PRP! (9.8100s+0.0000s) [Elapsed time: 10.00 seconds] modified 2020-07-07 22:30:37 created 2009-09-25 02:53:01 id 109586
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.