Base | Representation |
---|---|
bin | 1101001111000… |
… | …0000101001111 |
3 | 10212110011111000 |
4 | 3103300011033 |
5 | 103202244302 |
6 | 5301431343 |
7 | 1242551526 |
oct | 323600517 |
9 | 125404430 |
10 | 55509327 |
11 | 29373a85 |
12 | 1670b553 |
13 | b666c73 |
14 | 752d4bd |
15 | 4d1731c |
hex | 34f014f |
55509327 has 16 divisors (see below), whose sum is σ = 85812480. Its totient is φ = 35396856.
The previous prime is 55509323. The next prime is 55509331. The reversal of 55509327 is 72390555.
55509327 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 (55509323) and next prime (55509331).
It is not a de Polignac number, because 55509327 - 22 = 55509323 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 55509291 and 55509300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55509323) 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, 44073 + ... + 45314.
It is an arithmetic number, because the mean of its divisors is an integer number (5363280).
Almost surely, 255509327 is an apocalyptic number.
55509327 is a deficient number, since it is larger than the sum of its proper divisors (30303153).
55509327 is a wasteful number, since it uses less digits than its factorization.
55509327 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89419 (or 89413 counting only the distinct ones).
The product of its (nonzero) digits is 47250, while the sum is 36.
The square root of 55509327 is about 7450.4581738307. The cubic root of 55509327 is about 381.4655478428.
The spelling of 55509327 in words is "fifty-five million, five hundred nine thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •