Base | Representation |
---|---|
bin | 1101010000011… |
… | …1101100110100 |
3 | 10212122002012000 |
4 | 3110013230310 |
5 | 103213343233 |
6 | 5303455300 |
7 | 1243433550 |
oct | 324075464 |
9 | 125562160 |
10 | 55606068 |
11 | 2942a731 |
12 | 16757530 |
13 | b69bccb |
14 | 7556860 |
15 | 4d35d13 |
hex | 3507b34 |
55606068 has 48 divisors (see below), whose sum is σ = 164760960. Its totient is φ = 15887232.
The previous prime is 55606039. The next prime is 55606069. The reversal of 55606068 is 86060655.
55606068 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55606069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 36021 + ... + 37532.
It is an arithmetic number, because the mean of its divisors is an integer number (3432520).
Almost surely, 255606068 is an apocalyptic number.
It is an amenable number.
55606068 is an abundant number, since it is smaller than the sum of its proper divisors (109154892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55606068 is a wasteful number, since it uses less digits than its factorization.
55606068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 73573 (or 73565 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The square root of 55606068 is about 7456.9476329125. The cubic root of 55606068 is about 381.6870237823.
It can be divided in two parts, 5560 and 6068, that added together give a triangular number (11628 = T152).
The spelling of 55606068 in words is "fifty-five million, six hundred six thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •