Base | Representation |
---|---|
bin | 1101000111111… |
… | …1111001001101 |
3 | 10211120211010200 |
4 | 3101333321031 |
5 | 103043043210 |
6 | 5243524113 |
7 | 1235626026 |
oct | 321777115 |
9 | 124524120 |
10 | 55049805 |
11 | 2908a808 |
12 | 16529639 |
13 | b535a65 |
14 | 744dc4d |
15 | 4c760c0 |
hex | 347fe4d |
55049805 has 12 divisors (see below), whose sum is σ = 95419740. Its totient is φ = 29359872.
The previous prime is 55049803. The next prime is 55049809. The reversal of 55049805 is 50894055.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 42068196 + 12981609 = 6486^2 + 3603^2 .
It is not a de Polignac number, because 55049805 - 21 = 55049803 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 55049805.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55049803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 611620 + ... + 611709.
It is an arithmetic number, because the mean of its divisors is an integer number (7951645).
Almost surely, 255049805 is an apocalyptic number.
It is an amenable number.
55049805 is a deficient number, since it is larger than the sum of its proper divisors (40369935).
55049805 is a wasteful number, since it uses less digits than its factorization.
55049805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1223340 (or 1223337 counting only the distinct ones).
The product of its (nonzero) digits is 36000, while the sum is 36.
The square root of 55049805 is about 7419.5555796827. Note that the first 4 decimals coincide. The cubic root of 55049805 is about 380.4100029877.
The spelling of 55049805 in words is "fifty-five million, forty-nine thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •