Base | Representation |
---|---|
bin | 1101001111010… |
… | …0001011000000 |
3 | 10212111000110111 |
4 | 3103310023000 |
5 | 103203313310 |
6 | 5302041104 |
7 | 1242651421 |
oct | 323641300 |
9 | 125430414 |
10 | 55526080 |
11 | 29385625 |
12 | 16719194 |
13 | b67178c |
14 | 7535648 |
15 | 4d1c28a |
hex | 34f42c0 |
55526080 has 112 divisors (see below), whose sum is σ = 143195040. Its totient is φ = 20430848.
The previous prime is 55526077. The next prime is 55526083. The reversal of 55526080 is 8062555.
It is an interprime number because it is at equal distance from previous prime (55526077) and next prime (55526083).
It is a super-3 number, since 3×555260803 (a number of 24 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (55526083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 320874 + ... + 321046.
Almost surely, 255526080 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55526080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71597520).
55526080 is an abundant number, since it is smaller than the sum of its proper divisors (87668960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55526080 is a wasteful number, since it uses less digits than its factorization.
55526080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266 (or 256 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 31.
The square root of 55526080 is about 7451.5823822863. The cubic root of 55526080 is about 381.5039200700.
The spelling of 55526080 in words is "fifty-five million, five hundred twenty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •