483 · 23264181 + 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:483 · 23264181 + 1
Verification status (*):Proven
Official Comment (*):[none]
Unofficial Comments:This prime has 1 user comment below.
Proof-code(s): (*):L5174 : Scalise, LLR2, PSieve, Srsieve, PrimeGrid, LLR
Decimal Digits:982620   (log10 is 982619.07622358)
Rank (*):1632 (digit rank is 1)
Entrance Rank (*):1519
Currently on list? (*):short
Submitted:6/14/2022 16:55:33 CDT
Last modified:6/14/2022 17:37:28 CDT
Database id:134052
Status Flags:TrialDiv
Score (*):46.5792 (normalized score 7.1023)

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.

PrimeGrid writes (14 Jun 2022):  (report abuse)
Divides xGF(3264180,10,9).

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_id134052
person_id9
machineUsing: Dual Intel Xeon Gold 5222 CPUs 3.8GHz
whatprime
notesCommand: /home/caldwell/clientpool/1/pfgw64 -t -q"483*2^3264181+1" 2>&1 PFGW Version 4.0.1.64BIT.20191203.x86_Dev [GWNUM 29.8] Primality testing 483*2^3264181+1 [N-1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 5 Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 483*2^3264181+1 is prime! (1908.4157s+0.0006s) [Elapsed time: 31.82 minutes]
modified2022-07-11 13:21:44
created2022-06-14 16:56:01
id179786

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