p(2100412931)
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: | p(2100412931) |
|---|---|
| Verification status (*): | PRP |
| Official Comment (*): | Partitions, ECPP |
| Proof-code(s): (*): | E4 : Childers, CM |
| Decimal Digits: | 51046 (log10 is 51045.144557075) |
| Rank (*): | 65333 (digit rank is 1) |
| Entrance Rank (*): | 65321 |
| Currently on list? (*): | yes |
| Submitted: | 7/26/2026 07:07:52 UTC |
| Last modified: | 7/26/2026 16:37:28 UTC |
| Database id: | 142376 |
| Status Flags: | Verify |
| Score (*): | 37.4809 (normalized score 0.0001) |
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: yes, rank 11
Subcategory: "ECPP"
(archival tag id 240374, tag last modified 2026-07-26 16:37:32)- Partitions (archivable *)
- Prime on list: yes, rank 1
Subcategory: "Partitions"
(archival tag id 240375, tag last modified 2026-07-26 16:37:33)
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 142376 person_id 9 machine Using: Digital Ocean Droplet what prp notes Command: /var/www/clientpool/1/pfgw64 -V -f -tc p_142376.txt >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing 1394944970...3363646001 [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial
Running N-1 test using base 7
Generic modular reduction using generic reduction FMA3 FFT length 16K, Pass1=256, Pass2=64, clm=2 on A 169569-bit number
Running N-1 test using base 13
Generic modular reduction using generic reduction FMA3 FFT length 16K, Pass1=256, Pass2=64, clm=2 on A 169569-bit number
Running N+1 test using discriminant 31, base 15+sqrt(31)
Generic modular reduction using generic reduction FMA3 FFT length 16K, Pass1=256, Pass2=64, clm=2 on A 169569-bit number
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 37/169703 ERROR: ROUND OFF 0.5>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 31, base 15+sqrt(31)
Generic modular reduction using generic reduction FMA3 FFT length 18K, Pass1=384, Pass2=48, clm=2 on A 169569-bit number
Calling N+1 BLS with factored part 0.03% and helper 0.02% (0.12% proof)
1394944970...3363646001 is Fermat and Lucas PRP! (260.5786s+0.0144s)
[Elapsed time: 4.43 minutes]modified 2026-07-26 16:23:31 created 2026-07-26 15:48:00 id 188561
Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.