Base | Representation |
---|---|
bin | 110000001001101000… |
… | …110110011010010111 |
3 | 11221110011010201202002 |
4 | 300021220312122113 |
5 | 1321341013424002 |
6 | 35430134305515 |
7 | 3510130615334 |
oct | 601150663227 |
9 | 157404121662 |
10 | 51701311127 |
11 | 1aa21051304 |
12 | a02a7b829b |
13 | 4b4c387cbb |
14 | 270667798b |
15 | 1528e07002 |
hex | c09a36697 |
51701311127 has 2 divisors, whose sum is σ = 51701311128. Its totient is φ = 51701311126.
The previous prime is 51701311073. The next prime is 51701311153. The reversal of 51701311127 is 72111310715.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51701311127 - 210 = 51701310103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51701311127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51701811127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25850655563 + 25850655564.
It is an arithmetic number, because the mean of its divisors is an integer number (25850655564).
Almost surely, 251701311127 is an apocalyptic number.
51701311127 is a deficient number, since it is larger than the sum of its proper divisors (1).
51701311127 is an equidigital number, since it uses as much as digits as its factorization.
51701311127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1470, while the sum is 29.
The spelling of 51701311127 in words is "fifty-one billion, seven hundred one million, three hundred eleven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •