Base | Representation |
---|---|
bin | 10100111110111001011011 |
3 | 101100110021111 |
4 | 110332321123 |
5 | 2402004012 |
6 | 313521151 |
7 | 64516315 |
oct | 24767133 |
9 | 11313244 |
10 | 5500507 |
11 | 3117681 |
12 | 1a131b7 |
13 | 11a784c |
14 | a327b5 |
15 | 739ba7 |
hex | 53ee5b |
5500507 has 2 divisors, whose sum is σ = 5500508. Its totient is φ = 5500506.
The previous prime is 5500483. The next prime is 5500513. The reversal of 5500507 is 7050055.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 5500507 - 27 = 5500379 is a prime.
It is not a weakly prime, because it can be changed into another prime (5500567) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2750253 + 2750254.
It is an arithmetic number, because the mean of its divisors is an integer number (2750254).
Almost surely, 25500507 is an apocalyptic number.
5500507 is a deficient number, since it is larger than the sum of its proper divisors (1).
5500507 is an equidigital number, since it uses as much as digits as its factorization.
5500507 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 875, while the sum is 22.
The square root of 5500507 is about 2345.3159701840. The cubic root of 5500507 is about 176.5228404985.
The spelling of 5500507 in words is "five million, five hundred thousand, five hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •