"93074010508593618333...(6499 other digits)...83885253703080601131"
(Another of the Prime Pages' resources)
The Largest Known Primes Icon
  View this page in:   language help
 

At this site we maintain a list of the 5000 Largest Known Primes which is updated hourly. This list is the most important databases at The Prime Pages: 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:

field (help)value
Description:"93074010508593618333...(6499 other digits)...83885253703080601131"
Verification status (*):PRP
Official Comment:ECPP
Proof-code(s): (*):c6 : Larrosa, Primo
Decimal Digits:6539   (log10 is 6538.96882843)
Rank (*):79385 (digit rank is 3)
Entrance Rank (*):28157
Currently on list? (*):no
Submitted:2/13/2004 14:24:31 CDT
Last modified:2/13/2004 14:24:31 CDT
Database id:68825
Blob database id:108
Status Flags:Verify
Score (*):31.1225 (normalized score 0)

Description: (from blob table id=108)

This is bell number Bell(2841)

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.
Elliptic Curve Primality Proof (archivable *)
Prime on list: no, rank 309
Subcategory: "ECPP"
(archival tag id 194806, tag last modified 2018-11-04 20:50:19)

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_id68825
person_id9
machineLinux P4 2.8GHz
whatprp
notesPFGW Version 20031027.x86_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4]
Primality testing 9307401050...3080601131 [N-1/N+1, Brillhart-Lehmer-Selfridge]
trial factoring to 1814229
Running N-1 test using base 2
Using SSE2 FFT
Adjusting authentication level by 1 for PRIMALITY PROOF
Reduced from FFT(3072,21) to FFT(3072,20)
Reduced from FFT(3072,20) to FFT(3072,19)
Reduced from FFT(3072,19) to FFT(3072,18)
Reduced from FFT(3072,18) to FFT(3072,17)
Reduced from FFT(3072,17) to FFT(3072,16)
43452 bit request FFT size=(3072,16)
Running N-1 test using base 3
Using SSE2 FFT
Adjusting authentication level by 1 for PRIMALITY PROOF
Reduced from FFT(3072,21) to FFT(3072,20)
Reduced from FFT(3072,20) to FFT(3072,19)
Reduced from FFT(3072,19) to FFT(3072,18)
Reduced from FFT(3072,18) to FFT(3072,17)
Reduced from FFT(3072,17) to FFT(3072,16)
43452 bit request FFT size=(3072,16)
Running N-1 test using base 7
Using SSE2 FFT
Adjusting authentication level by 1 for PRIMALITY PROOF
Reduced from FFT(3072,21) to FFT(3072,20)
Reduced from FFT(3072,20) to FFT(3072,19)
Reduced from FFT(3072,19) to FFT(3072,18)
Reduced from FFT(3072,18) to FFT(3072,17)
Reduced from FFT(3072,17) to FFT(3072,16)
43452 bit request FFT size=(3072,16)
Running N+1 test using discriminant 17, base 1+sqrt(17)
Using SSE2 FFT
Adjusting authentication level by 1 for PRIMALITY PROOF
Reduced from FFT(3072,21) to FFT(3072,20)
Reduced from FFT(3072,20) to FFT(3072,19)
Reduced from FFT(3072,19) to FFT(3072,18)
Reduced from FFT(3072,18) to FFT(3072,17)
Reduced from FFT(3072,17) to FFT(3072,16)
43460 bit request FFT size=(3072,16)
Calling N-1 BLS with factored part 0.12% and helper 0.01% (0.36% proof)
9307401050...3080601131 is Fermat and Lucas PRP! (41.2718s+0.0037s)
modified2004-02-13 14:27:42
created2004-02-13 14:27:01
id73776

Query times: 0.0004 seconds to select prime, 0.0006 seconds to seek comments.