Base | Representation |
---|---|
bin | 110000000011101100… |
… | …001100101101111111 |
3 | 11221012012101002202222 |
4 | 300003230030231333 |
5 | 1321134442310011 |
6 | 35412211435555 |
7 | 3504506505455 |
oct | 600354145577 |
9 | 157165332688 |
10 | 51601525631 |
11 | 1a97a796a57 |
12 | a0012b5bbb |
13 | 4b347bb026 |
14 | 26d73009d5 |
15 | 1520295ddb |
hex | c03b0cb7f |
51601525631 has 2 divisors, whose sum is σ = 51601525632. Its totient is φ = 51601525630.
The previous prime is 51601525609. The next prime is 51601525667. The reversal of 51601525631 is 13652510615.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51601525631 - 214 = 51601509247 is a prime.
It is a super-2 number, since 2×516015256312 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51601525591 and 51601525600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51601525691) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25800762815 + 25800762816.
It is an arithmetic number, because the mean of its divisors is an integer number (25800762816).
Almost surely, 251601525631 is an apocalyptic number.
51601525631 is a deficient number, since it is larger than the sum of its proper divisors (1).
51601525631 is an equidigital number, since it uses as much as digits as its factorization.
51601525631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 51601525631 in words is "fifty-one billion, six hundred one million, five hundred twenty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •