Base | Representation |
---|---|
bin | 110000001010001100… |
… | …101000010011010001 |
3 | 11221110210210020211202 |
4 | 300022030220103101 |
5 | 1321400414044023 |
6 | 35431111320545 |
7 | 3510303421436 |
oct | 601214502321 |
9 | 157423706752 |
10 | 51710690513 |
11 | 1aa26378169 |
12 | a031980155 |
13 | 4b512c0231 |
14 | 27079d9b8d |
15 | 1529b5b128 |
hex | c0a3284d1 |
51710690513 has 2 divisors, whose sum is σ = 51710690514. Its totient is φ = 51710690512.
The previous prime is 51710690509. The next prime is 51710690519. The reversal of 51710690513 is 31509601715.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51703028689 + 7661824 = 227383^2 + 2768^2 .
It is a cyclic number.
It is not a de Polignac number, because 51710690513 - 22 = 51710690509 is a prime.
It is not a weakly prime, because it can be changed into another prime (51710690519) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25855345256 + 25855345257.
It is an arithmetic number, because the mean of its divisors is an integer number (25855345257).
Almost surely, 251710690513 is an apocalyptic number.
It is an amenable number.
51710690513 is a deficient number, since it is larger than the sum of its proper divisors (1).
51710690513 is an equidigital number, since it uses as much as digits as its factorization.
51710690513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28350, while the sum is 38.
The spelling of 51710690513 in words is "fifty-one billion, seven hundred ten million, six hundred ninety thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •