Phi(3, - 68250465536)

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.

Description:Phi(3, - 68250465536)
Verification status (*):Proven
Official Comment (*):Generalized unique
Proof-code(s): (*):p379 : Batalov, CycloSv, Cyclo, EMsieve, PIES, OpenPFGW
Decimal Digits:764688   (log10 is 764687.83690822)
Rank (*):1720 (digit rank is 1)
Entrance Rank (*):271
Currently on list? (*):yes
Submitted:5/7/2015 11:10:50 CDT
Last modified:5/7/2015 14:50:29 CDT
Database id:119888
Status Flags:TrialDiv
Score (*):45.8096 (normalized score 4.1542)

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 38
Subcategory: "Generalized Unique"
(archival tag id 224114, tag last modified 2020-08-04 13:50:04)

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.
fieldvalue
prime_id119888
person_id9
machineUsing: Xeon 4c+4c 3.5GHz
whatprime
notesCommand: /home/caldwell/client/pfgw/pfgw64 -t -q"Phi(3,-682504^65536)" 2>&1 PFGW Version 3.7.7.64BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing Phi(3,-682504^65536) [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 7 Calling Brillhart-Lehmer-Selfridge with factored part 42.26% Phi(3,-682504^65536) is prime! (12850.8271s+0.2484s) [Elapsed time: 3.57 hours]
modified2020-07-07 17:30:17
created2015-05-07 11:11:01
id165511

Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.