150209! + 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:150209! + 1
Verification status (*):Proven
Official Comment (*):Factorial
Proof-code(s): (*):p3 : Dohmen, OpenPFGW
Decimal Digits:712355   (log10 is 712354.37028954)
Rank (*):2182 (digit rank is 1)
Entrance Rank (*):73
Currently on list? (*):short
Submitted:10/31/2011 08:21:31 CDT
Last modified:11/3/2011 03:21:05 CDT
Database id:102627
Status Flags:none
Score (*):45.592 (normalized score 3.112)

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.
Factorial primes (archivable *)
Prime on list: yes, rank 2
Subcategory: "Factorial"
(archival tag id 213604, tag last modified 2016-07-27 01:20:35)

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.
machineRedHat P4 P4
notesCommand: /home/caldwell/client/pfgw -t -q"150209!+1" 2>&1 PFGW Version [GWNUM 26.5] Primality testing 150209!+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 150211 Running N-1 test using base 150217 Calling Brillhart-Lehmer-Selfridge with factored part 33.45% 150209!+1 is prime! (240480.6224s+2.6547s) [Elapsed time: 2.78 days]
modified2020-07-07 17:30:30
created2011-10-31 08:23:01

machineDitto P4 P4
notesCommand: /home/ditto/client/TrialDiv/TrialDiv -q 1 150209 ! 1 2>&1 [Elapsed time: 59234.044 seconds]
modified2020-07-07 17:30:30
created2011-10-31 08:35:02

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