Base | Representation |
---|---|
bin | 110011101100000101… |
… | …100110110001010101 |
3 | 12022020220222112012001 |
4 | 303230011212301111 |
5 | 1402131112000203 |
6 | 41255132155301 |
7 | 4003232316025 |
oct | 635405466125 |
9 | 168226875161 |
10 | 55500500053 |
11 | 215a0649169 |
12 | a90b008b31 |
13 | 53064ca19b |
14 | 2987077a85 |
15 | 169c71291d |
hex | cec166c55 |
55500500053 has 8 divisors (see below), whose sum is σ = 56968128000. Its totient is φ = 54038298720.
The previous prime is 55500500017. The next prime is 55500500071. The reversal of 55500500053 is 35000500555.
55500500053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55500500053 - 217 = 55500368981 is a prime.
It is a super-2 number, since 2×555005000532 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 55500499994 and 55500500030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55500504053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1335925 + ... + 1376842.
It is an arithmetic number, because the mean of its divisors is an integer number (7121016000).
Almost surely, 255500500053 is an apocalyptic number.
It is an amenable number.
55500500053 is a deficient number, since it is larger than the sum of its proper divisors (1467627947).
55500500053 is a wasteful number, since it uses less digits than its factorization.
55500500053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2713307.
The product of its (nonzero) digits is 9375, while the sum is 28.
The spelling of 55500500053 in words is "fifty-five billion, five hundred million, five hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •