160204065 · 2262148 - 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.

Description:160204065 · 2262148 - 1
Verification status (*):Proven
Official Comment (*):Twin (p)
Proof-code(s): (*):L5115 : Doescher, LLR
Decimal Digits:78923   (log10 is 78922.615976853)
Rank (*):49002 (digit rank is 2)
Entrance Rank (*):48615
Currently on list? (*):short
Submitted:7/8/2021 07:02:14 CDT
Last modified:7/8/2021 07:38:19 CDT
Database id:132450
Status Flags:TrialDiv
Score (*):38.8248 (normalized score 0.0036)

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.
Twin Primes (archivable *)
Prime on list: yes, rank 4
Subcategory: "Twin (p)"
(archival tag id 226162, tag last modified 2021-07-08 07:38:21)

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_id132450
person_id9
machineUsing: Xeon 4c+4c 3.5GHz
whatprime
notesCommand: /home/caldwell/client/llr.pl 160204065*2^262148-1 2>&1
Starting Lucas Lehmer Riesel prime test of 160204065*2^262148-1
Using zero-padded AVX FFT length 25K, Pass1=320, Pass2=80
V1 = 11 ; Computing U0...
V1 = 11 ; Computing U0...done.Starting Lucas-Lehmer loop...


160204065*2^262148-1 is prime! (78923 decimal digits) Time : 29.704 sec.
[Elapsed time: 30.00 seconds]
modified2021-07-08 07:06:31
created2021-07-08 07:06:01
id178162

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