Base | Representation |
---|---|
bin | 11000011000010010000001… |
… | …11110101110100010100111 |
3 | 21000211011000211211002201221 |
4 | 30030021000332232202213 |
5 | 24011330031211132210 |
6 | 310004254455201211 |
7 | 14202154245656464 |
oct | 1414110076564247 |
9 | 230734024732657 |
10 | 53610871974055 |
11 | 1609a274662390 |
12 | 601a190676207 |
13 | 23bb639430906 |
14 | d34acc64a66b |
15 | 62e81d9221da |
hex | 30c240fae8a7 |
53610871974055 has 32 divisors (see below), whose sum is σ = 72447144652800. Its totient is φ = 37731096172800.
The previous prime is 53610871973983. The next prime is 53610871974109. The reversal of 53610871974055 is 55047917801635.
It is not a de Polignac number, because 53610871974055 - 227 = 53610737756327 is a prime.
It is a Smith number, since the sum of its digits (61) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 53610871973984 and 53610871974002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76048486 + ... + 76750204.
It is an arithmetic number, because the mean of its divisors is an integer number (2263973270400).
Almost surely, 253610871974055 is an apocalyptic number.
53610871974055 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
53610871974055 is a deficient number, since it is larger than the sum of its proper divisors (18836272678745).
53610871974055 is a wasteful number, since it uses less digits than its factorization.
53610871974055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 746575.
The product of its (nonzero) digits is 31752000, while the sum is 61.
The spelling of 53610871974055 in words is "fifty-three trillion, six hundred ten billion, eight hundred seventy-one million, nine hundred seventy-four thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •