In December 2018, GIMPS discovered the known Mersenne Prime , .
If the known perfect number (a positive integer that is equal to the sum of its proper positive divisors) were written in binary notation, how many digits would it have?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Let q = 8 2 5 8 9 9 3 3 . All known perfect numbers are of the form 2 p − 1 ( 2 p − 1 ) where 2 p − 1 is a Mersenne prime. Furthermore, all Mersenne primes correspond to a perfect number of this form. Thus, the 5 1 st known perfect number is 2 q − 1 ( 2 q − 1 ) = 2 2 q − 1 − 2 q . Note that 2 q < 2 2 q − 2 . Thus, 2 2 q − 2 < 2 2 q − 1 − 2 q < 2 2 q − 1 and 2 2 q − 1 − 2 q has 2 q − 1 = 1 6 5 1 7 9 8 6 5 binary digits.