To be removed soon:   language help

69 · 247657 - 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:69 · 247657 - 1
Verification status (*):Proven
Official Comment (*):Arithmetic progression (1,d=(465*2^50854-69)*2^47656) [x12]
Proof-code(s): (*):g127 : Andrews, Proth.exe
Decimal Digits:14349   (log10 is 14348.0253524491)
Rank (*):71228 (digit rank is 1)
Entrance Rank (*):1590
Currently on list? (*):no
Submitted:7/10/1999 07:01:32 CDT
Last modified:7/10/1999 07:01:32 CDT
Database id:13165
Status Flags:none
Score (*):33.5585 (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.
Arithmetic Progressions of Primes (archivable class *)
Prime on list: no, rank 101
Subcategory: "Arithmetic progression (1,d=*)"
(archival tag id 192580, tag last modified 2019-07-04 05:50:22)

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_id13165
person_id9
machineWindows XP P4 1.8GHz
whatprime
notesPrimality testing 69*2^47657-1 [N+1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 99.99% 69*2^47657-1 is prime! (76.141000 seconds) PFGW Version 1.1 for Windows Running N+1 test using discriminant 5, base 1+sqrt(5)
modified2003-03-25 11:25:20
created2002-12-10 06:33:21
id36264

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