2788032⁵²⁴²⁸⁸ + 1

This prime's information:

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.

Generalized Fermat (archivable *)

Prime on list: yes, rank 20
Subcategory: "Generalized Fermat"
(archival tag id 220221, tag last modified 2024-04-19 01:37:21)

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 (18 Apr 2019):  (report abuse)

cllr64 -v LLR Program - Version 3.8.21, using Gwnum Library Version 28.14 cllr64 -d -t4 -oNextFFTifNearLimit=1 -oDiskWriteTime=1 -q"2788032^524288+1" Base factorized as : 2^6*3*13*1117 Base prime factor(s) taken : 13, 1117 Current FFT beeing too near the limit, next FFT length is forced... Starting N-1 prime test of 2788032^524288+1 Using generic reduction FMA3 FFT length 1200K, Pass1=320, Pass2=3840, 4 threads, a = 3 2788032^524288+1 may be prime, trying to compute gcd's 3^((N-1)/1117)-1 is coprime to N! 3^((N-1)/13)-1 is coprime to N! 2788032^524288+1 is prime! (3379193 decimal digits) Time : 90210.492 sec.

PrimeGrid writes (26 Apr 2019):  (report abuse)

For more information, please see the official announcement.

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.