4011*2^842770-1 (253703 digits)

Congrats pb - #3 on the RPS project list!

4049*2^846456-1 (254813 digits)

4037*2^847064-1 (254996 digits)

Would you believe it. I'm really liking this k. :banana:

1087*2^3336385-1 (1004355 digits)

Big congrats on one million digits, Peter! :smile:

[QUOTE=pb386;293197]Would you believe it. I'm really liking this k. :banana:

1087*2^3336385-1 (1004355 digits)[/QUOTE]
wow! congrats! now we know the same amount of mersenne primes as we know primes with over a million digits (each set contain 47 numbers).
If there are 37 mersenne primes under a million digits, it follows that we know 37 primes with over a million digits which are not mersenne numbers, and it also follows that we have 10 numbers which are both mersenne primes and primes with over a million digits. Bot 37 and 47 are primes, and 10 is the most common numeration base... Unbeatable logic huh? In fact, related to 10, we can say many things about it, like "there are 10 kind of people: the kind who understand binary enumeration system, and the kind who don't"...
:smile:

[QUOTE=pb386;293197]Would you believe it. I'm really liking this k. :banana:

1087*2^3336385-1 (1004355 digits)[/QUOTE]

Amazing! Congratulations! :toot:

1075*2^1194063-1 (359452 digits)

4101*2^850227-1 (255948 digits)

1003323*2^755250-1 (227359 digits)