Base | Representation |
---|---|
bin | 101111100110011001… |
… | …011010000111100001 |
3 | 11212220221121002101012 |
4 | 233212121122013201 |
5 | 1314133133414023 |
6 | 35251333550305 |
7 | 3456361226531 |
oct | 574631320741 |
9 | 155827532335 |
10 | 51110060513 |
11 | 1a748329a36 |
12 | 9aa47a5395 |
13 | 4a86a33975 |
14 | 268bd2b4c1 |
15 | 14e2066978 |
hex | be665a1e1 |
51110060513 has 2 divisors, whose sum is σ = 51110060514. Its totient is φ = 51110060512.
The previous prime is 51110060483. The next prime is 51110060569. The reversal of 51110060513 is 31506001115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29907205969 + 21202854544 = 172937^2 + 145612^2 .
It is a cyclic number.
It is not a de Polignac number, because 51110060513 - 28 = 51110060257 is a prime.
It is a super-2 number, since 2×511100605132 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51110060713) 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, 25555030256 + 25555030257.
It is an arithmetic number, because the mean of its divisors is an integer number (25555030257).
Almost surely, 251110060513 is an apocalyptic number.
It is an amenable number.
51110060513 is a deficient number, since it is larger than the sum of its proper divisors (1).
51110060513 is an equidigital number, since it uses as much as digits as its factorization.
51110060513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 23.
Adding to 51110060513 its reverse (31506001115), we get a palindrome (82616061628).
The spelling of 51110060513 in words is "fifty-one billion, one hundred ten million, sixty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •