2 · 1103368361 + 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:2 · 1103368361 + 1
Verification status (*):Proven
Official Comment (*):Divides Phi(1103^368361,2)
Proof-code(s): (*):L4879 : Propper, Batalov, Srsieve, LLR
Decimal Digits:1120767   (log10 is 1120766.459368)
Rank (*):836 (digit rank is 1)
Entrance Rank (*):191
Currently on list? (*):short
Submitted:1/26/2019 15:32:36 UTC
Last modified:5/20/2023 20:59:19 UTC
Database id:125939
Status Flags:none
Score (*):46.9828 (normalized score 7.5714)

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.
Divides Phi (archivable *)
Prime on list: yes, rank 7
Subcategory: "Divides Phi"
(archival tag id 220034, tag last modified 2023-03-11 15:53:59)

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_id125939
person_id9
machineUsing: Xeon (pool) 4c+4c 3.5GHz
whatprime
notesCommand: /home/caldwell/clientpool/1/pfgw64 -t -q"2*1103^368361+1" 2>&1 PFGW Version 3.7.7.64BIT.20130722.x86_Dev [GWNUM 27.11] Primality testing 2*1103^368361+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 2*1103^368361+1 is prime! (8692.3757s+0.0358s) [Elapsed time: 2.41 hours]
modified2020-07-07 22:30:14
created2019-01-26 15:33:01
id171616

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