Phi(3539, - 2)
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: | Phi(3539, - 2) |
|---|---|
| Verification status (*): | Proven |
| Official Comment (*): | Generalized unique |
| Proof-code(s): (*): | c5 : Carmody, Primo |
| Decimal Digits: | 1066 (log10 is 1065.0441246592) |
| Rank (*): | 128803 (digit rank is 70) |
| Entrance Rank (*): | 47584 |
| Currently on list? (*): | no |
| Submitted: | 3/6/2001 17:27:56 UTC |
| Last modified: | 2/4/2026 10:43:50 UTC |
| Database id: | 54343 |
| Status Flags: | none |
| Score (*): | 25.4691 (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 Unique (archivable *)
- Prime on list: no, rank 1583
Subcategory: "Generalized Unique"
(archival tag id 225627, tag last modified 2026-01-09 22:37:30)
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 54343 person_id 9 machine Using: Digital Ocean Droplet what prime notes Command: /var/www/clientpool/1/pfgw64 -V -f -tc -hhelper.php?id=1100000000005969882 -q"Phi(3539,-2)" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing Phi(3539,-2) [N-1/N+1, Brillhart-Lehmer-Selfridge]
Reading factors from helper file helper.php?id=1100000000005969882
trial
Running N-1 test using base 2
Generic modular reduction using all-complex FMA3 FFT length 160 on (2^3539+1)/3
Running N-1 test using base 5
Generic modular reduction using all-complex FMA3 FFT length 160 on (2^3539+1)/3
Running N+1 test using discriminant 13, base 1+sqrt(13)
Generic modular reduction using all-complex FMA3 FFT length 160 on (2^3539+1)/3
Detected in MAXERR>0.45 (round off check) in Exponentiator::Iterate
Iteration: 140/7910 ERROR: ROUND OFF 0.5>0.45
(Test aborted, try again using the -a1 switch)
Running N+1 test using discriminant 13, base 1+sqrt(13)
Generic modular reduction using all-complex FMA3 FFT length 192 on (2^3539+1)/3
Calling N+1 BLS with factored part 38.25% and helper 15.47% (130.28% proof)
Phi(3539,-2) is prime! (0.0412s+0.0054s)
[Elapsed time: 5.00 seconds]
Helper File:
2
59
233
1103
2089
3539
3033169
39232883
2278390627
10199969089
114219291889
726533058611
768614336404564651
2305843009213693951
8899767592265771227579
754338065822803709234804940450134987
3
19
787
1049
25939
82531
87211
198073
4744297
57384289
182331128681207781784391813611
7237497065445543055003057643920459
9893184170683880261534636451475819
433685074806886298028919267117655888254843
358481631294404888613030634349490904280996785041660793
175639552585373358307268617903286656284026269783398738412720155379
52971487719297043857348476822653629...(107 digits)...47370545457828497960999708594427043modified 2026-02-04 10:43:50 created 2026-02-04 10:43:45 id 187715
field value prime_id 54343 person_id 9 machine Using: Digital Ocean Droplet what prp notes Command: /var/www/clientpool/1/pfgw64 -V -f -t -hhelper_1100000000005969882.txt -q"Phi(3539,-2)" >command_output 2>&1
PFGW Version 4.0.4.64BIT.20221214.x86_Dev [GWNUM 30.11]
Primality testing Phi(3539,-2) [N-1, Brillhart-Lehmer-Selfridge]
Reading factors from helper file helper_1100000000005969882.txt
Prime_Testing_Warning,
Running N-1 test using base 2
Generic modular reduction using all-complex FMA3 FFT length 160 on (2^3539+1)/3
Running N-1 test using base 5
Generic modular reduction using all-complex FMA3 FFT length 160 on (2^3539+1)/3
Calling Brillhart-Lehmer-Selfridge with factored part 15.47%
Phi(3539,-2) is PRP! (0.0146s+0.0050s)
[Elapsed time: 5.00 seconds]
Helper File:
2
59
233
1103
2089
3539
3033169
39232883
2278390627
10199969089
114219291889
726533058611
768614336404564651
2305843009213693951
8899767592265771227579
754338065822803709234804940450134987
3
19
787
1049
25939
82531
87211
198073
4744297
57384289
182331128681207781784391813611
7237497065445543055003057643920459
9893184170683880261534636451475819
433685074806886298028919267117655888254843
358481631294404888613030634349490904280996785041660793
175639552585373358307268617903286656284026269783398738412720155379
52971487719297043857348476822653629...(107 digits)...47370545457828497960999708594427043modified 2026-02-04 10:42:30 created 2026-02-04 10:42:25 id 187713
field value prime_id 54343 person_id 9 machine Linux PII 200 what prp notes PFGW Version 20020311.x86_Dev (Alpha software, 'caveat utilitor') Running N-1 test using base 2 Primality testing Phi(3539,-2) [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Running N+1 test using discriminant 13, base 1+sqrt(13) Running N+1 test using discriminant 13, base 2+sqrt(13) Running N+1 test using discriminant 13, base 3+sqrt(13) Running N+1 test using discriminant 13, base 6+sqrt(13) Running N+1 test using discriminant 13, base 8+sqrt(13) Calling N+1 BLS with factored part 2.69% and helper 1.33% (9.44% proof) Phi(3539,-2) is Fermat and Lucas PRP! (47.090000 seconds) modified 2003-03-25 17:23:04 created 2003-01-04 05:44:54 id 60789
Query times: 0.0003 seconds to select prime, 0.0004 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.