Base | Representation |
---|---|
bin | 1101001100010… |
… | …0111010011100 |
3 | 10212010011221011 |
4 | 3103010322130 |
5 | 103131120013 |
6 | 5253545004 |
7 | 1241214160 |
oct | 323047234 |
9 | 125104834 |
10 | 55332508 |
11 | 29263150 |
12 | 16645164 |
13 | b60463a |
14 | 74c4ca0 |
15 | 4ccec3d |
hex | 34c4e9c |
55332508 has 24 divisors (see below), whose sum is σ = 120726144. Its totient is φ = 21558000.
The previous prime is 55332499. The next prime is 55332517. The reversal of 55332508 is 80523355.
55332508 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (55332499) and next prime (55332517).
It is a self number, because there is not a number n which added to its sum of digits gives 55332508.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 89518 + ... + 90133.
It is an arithmetic number, because the mean of its divisors is an integer number (5030256).
Almost surely, 255332508 is an apocalyptic number.
It is an amenable number.
55332508 is an abundant number, since it is smaller than the sum of its proper divisors (65393636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55332508 is a wasteful number, since it uses less digits than its factorization.
55332508 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179673 (or 179671 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 31.
The square root of 55332508 is about 7438.5823918271. The cubic root of 55332508 is about 381.0600778315.
The spelling of 55332508 in words is "fifty-five million, three hundred thirty-two thousand, five hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •