(2137 + 4274)!(2127 - 1) - 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.

This prime's information:

Description:(2137 + 4274)!(2127 - 1) - 1
Verification status (*):PRP
Official Comment (*):Multifactorial
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):p44 : Broadhurst, OpenPFGW
Decimal Digits:41792   (log10 is 41791.806869449)
Rank (*):63550 (digit rank is 1)
Entrance Rank (*):3889
Currently on list? (*):no
Submitted:11/11/2003 23:42:49 UTC
Last modified:3/11/2023 15:54:10 UTC
Database id:67139
Status Flags:Verify
Score (*):36.8635 (normalized score 0.0002)

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.
Multifactorial (tolerated *)
Prime on list: no, rank 118
Subcategory: "Multifactorial"
(archival tag id 190619, tag last modified 2023-05-01 02:37:23)

User comments about this prime (disclaimer):

User comments are allowed to convey mathematical information about this number, how it was proven prime.... See our guidelines and restrictions.

David Broadhurst writes (11 Sep 2014):  (report abuse)
helper

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_id67139
person_id9
machineLinux P4 2.8GHz
whatprp
notesPFGW Version 20030811.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 6410168550...6643744934trial factoring to 13398173 Running N-1 test using base 1087 6836841759...9999999999 [N-1/N+1, Brillhart-Lehmer-Selfridge] Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(16384,20) to FFT(16384,19) Reduced from FFT(16384,19) to FFT(16384,18) Reduced from FFT(16384,18) to FFT(16384,17) 277668 bit request FFT size=(16384,17) Running N+1 test using discriminant 1097, base 1+sqrt(1097) Using SSE2 FFT Adjusting authentication level by 1 for PRIMALITY PROOF Reduced from FFT(16384,20) to FFT(16384,19) Reduced from FFT(16384,19) to FFT(16384,18) Reduced from FFT(16384,18) to FFT(16384,17) 277676 bit request FFT size=(16384,17) Calling N+1 BLS with factored part 16.62% and helper 0.00% (49.85% proof) 6410168550...9999999999 is Fermat and Lucas PRP! (-619.6273s+0.0600s)
modified2020-07-07 22:30:47
created2003-11-11 23:53:02
id72064

Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.
Printed from the PrimePages <t5k.org> © Reginald McLean.