Information as of 2020-04-07: Inserting more history entries for Riesel primes k<300 (k=1-49 done)
- Collected: MersenneForum thread "POST LOTS AND LOTS OF PRIMES HERE": #1 (2010-03-17) - #1945 (2020-03-11) (100%) done.
- Collected: IDs for Riesel primes of the The Prime Pages: k = 1 - 299 (100%) done.
- DONE: MersenneForum thread "Riesel Primes k*2^n-1, k<300 (Part II)" (#1 (2007-07-08) - #986 (2020-04-06)).
- Please check your reservations here.
M38
M38 | |
---|---|
Prime class : | |
Type : | Mersenne prime |
Formula : | M_{n} = 2^{n} - 1 |
Prime data : | |
Rank : | 38 |
n-value : | 6,972,593 |
Number : | 437075744127...142924193791 |
Digits : | 2,098,960 |
Perfect number : | 2^{6,972,592} • (2^{6,972,593}-1) |
Digits : | 4,197,919 |
Discovery data : | |
Date of Discovery : | 1999-06-01 |
Discoverer : | Nayan Hajratwala |
Found with : | Lucas-Lehmer test / Prime95 on 350 MHz Pentium II IBM Aptiva |
Credits : | George Woltman et. al. GIMPS |
M38 is the short hand used to refer to the 38th Mersenne prime. Specifically it is 2^{6,972,593}-1. This number was discovered to be prime on 1999-06-01 by Nayan Hajratwala, using Prime95 written by George Woltman. The number is 2,098,960 decimal digits long.
The prime was independently verified by David Willmore using Mlucas program written by Ernst Mayer using two weeks of computer time donated by Aerial Communications on a 500 MHz DEC Alpha workstation.
This prime number was the fourth record prime found by the GIMPS project.