Base | Representation |
---|---|
bin | 110011101001111010… |
… | …101100101000100101 |
3 | 12022011101110111120101 |
4 | 303221322230220211 |
5 | 1402042301223203 |
6 | 41251351504101 |
7 | 4002310644535 |
oct | 635172545045 |
9 | 168141414511 |
10 | 55464086053 |
11 | 21582037852 |
12 | a8ba988031 |
13 | 52cbaba93c |
14 | 29822b94c5 |
15 | 169941d41d |
hex | ce9eaca25 |
55464086053 has 2 divisors, whose sum is σ = 55464086054. Its totient is φ = 55464086052.
The previous prime is 55464085979. The next prime is 55464086099. The reversal of 55464086053 is 35068046455.
It is an a-pointer prime, because the next prime (55464086099) can be obtained adding 55464086053 to its sum of digits (46).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 36114441444 + 19349644609 = 190038^2 + 139103^2 .
It is a cyclic number.
It is not a de Polignac number, because 55464086053 - 233 = 46874151461 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 55464085994 and 55464086012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55464083053) 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, 27732043026 + 27732043027.
It is an arithmetic number, because the mean of its divisors is an integer number (27732043027).
Almost surely, 255464086053 is an apocalyptic number.
It is an amenable number.
55464086053 is a deficient number, since it is larger than the sum of its proper divisors (1).
55464086053 is an equidigital number, since it uses as much as digits as its factorization.
55464086053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728000, while the sum is 46.
The spelling of 55464086053 in words is "fifty-five billion, four hundred sixty-four million, eighty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •