Base | Representation |
---|---|
bin | 110001011010101001… |
… | …101101001001111111 |
3 | 12001221212200011102222 |
4 | 301122221231021333 |
5 | 1332131441133410 |
6 | 40213050235555 |
7 | 3555613502462 |
oct | 613251551177 |
9 | 161855604388 |
10 | 53060489855 |
11 | 2055929940a |
12 | a349a25bbb |
13 | 5007b43179 |
14 | 27d4da12d9 |
15 | 15a83d6955 |
hex | c5aa6d27f |
53060489855 has 16 divisors (see below), whose sum is σ = 65963875584. Its totient is φ = 40930755840.
The previous prime is 53060489759. The next prime is 53060489857. The reversal of 53060489855 is 55898406035.
It is not a de Polignac number, because 53060489855 - 212 = 53060485759 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53060489797 and 53060489806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (53060489857) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 574982 + ... + 660851.
It is an arithmetic number, because the mean of its divisors is an integer number (4122742224).
Almost surely, 253060489855 is an apocalyptic number.
53060489855 is a deficient number, since it is larger than the sum of its proper divisors (12903385729).
53060489855 is a wasteful number, since it uses less digits than its factorization.
53060489855 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1236146.
The product of its (nonzero) digits is 5184000, while the sum is 53.
The spelling of 53060489855 in words is "fifty-three billion, sixty million, four hundred eighty-nine thousand, eight hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.626 sec. • engine limits •