Base | Representation |
---|---|
bin | 1101001110110… |
… | …1111100010111 |
3 | 10212102201110120 |
4 | 3103231330113 |
5 | 103202004232 |
6 | 5301323023 |
7 | 1242514143 |
oct | 323557427 |
9 | 125381416 |
10 | 55500567 |
11 | 29368441 |
12 | 16706473 |
13 | b662c95 |
14 | 752a223 |
15 | 4d1492c |
hex | 34edf17 |
55500567 has 8 divisors (see below), whose sum is σ = 74144880. Its totient is φ = 36928320.
The previous prime is 55500527. The next prime is 55500607. The reversal of 55500567 is 76500555.
It is an interprime number because it is at equal distance from previous prime (55500527) and next prime (55500607).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 55500567 - 211 = 55498519 is a prime.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55500527) 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 7 ways as a sum of consecutive naturals, for example, 16192 + ... + 19317.
It is an arithmetic number, because the mean of its divisors is an integer number (9268110).
Almost surely, 255500567 is an apocalyptic number.
55500567 is a deficient number, since it is larger than the sum of its proper divisors (18644313).
55500567 is a wasteful number, since it uses less digits than its factorization.
55500567 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36033.
The product of its (nonzero) digits is 26250, while the sum is 33.
The square root of 55500567 is about 7449.8702673268. The cubic root of 55500567 is about 381.4454802603.
The spelling of 55500567 in words is "fifty-five million, five hundred thousand, five hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •