# 361275 · 2^{361275} + 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: | 361275 · 2^{361275} + 1 |
---|---|

Verification status (*): | Proven |

Official Comment (*): | Cullen |

Proof-code(s): (*): | DS : Smith_Darren, Proth.exe |

Decimal Digits: | 108761 (log_{10} is 108760.16952141) |

Rank (*): | 42055 (digit rank is 1) |

Entrance Rank (*): | 7 |

Currently on list? (*): | short |

Submitted: | 7/31/1998 08:20:52 CDT |

Last modified: | 7/31/1998 08:20:52 CDT |

Database id: | 102 |

Status Flags: | none |

Score (*): | 39.8129 (normalized score 0.0096) |

#### 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.

- Cullen primes (archivable *)
- Prime on list:
yes, rank5

Subcategory: "Cullen primes"

(archival tag id 187601, tag last modified 2009-08-04 21:58:38)

#### 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.

field value prime_id 102 person_id 9 machine WinXP P4 1.8GHz what prime notes PFGW Version 20021217.Win_Dev (Beta 'caveat utilitor') [FFT v22.7 w/P4] Running N-1 test using base 7 N-1: 361275*2^361275+1 277500/361295Primality testing 361275*2^361275+1 [N-1, Brillhart-Lehmer-Selfridge] Calling Brillhart-Lehmer-Selfridge with factored part 100.00% 361275*2^361275+1 is prime! (1198.271000 seconds) modified 2003-03-25 11:21:47 created 2003-01-23 03:27:11 id 67341

Query times: 0.0002 seconds to select prime, 0.0003 seconds to seek comments.

Printed from the PrimePages <primes.utm.edu> © Chris Caldwell.