Base | Representation |
---|---|
bin | 100000111001101… |
… | …111100110110101 |
3 | 1102110200220210002 |
4 | 200321233212311 |
5 | 2112303224432 |
6 | 130435241045 |
7 | 16451664053 |
oct | 4071574665 |
9 | 1373626702 |
10 | 552008117 |
11 | 263659961 |
12 | 134a49185 |
13 | 8a49452b |
14 | 534531d3 |
15 | 336dce62 |
hex | 20e6f9b5 |
552008117 has 2 divisors, whose sum is σ = 552008118. Its totient is φ = 552008116.
The previous prime is 552008111. The next prime is 552008129. The reversal of 552008117 is 711800255.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 404774161 + 147233956 = 20119^2 + 12134^2 .
It is a cyclic number.
It is not a de Polignac number, because 552008117 - 24 = 552008101 is a prime.
It is a super-2 number, since 2×5520081172 = 609425922467771378, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 552008117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (552008111) 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 as a sum of consecutive naturals, namely, 276004058 + 276004059.
It is an arithmetic number, because the mean of its divisors is an integer number (276004059).
Almost surely, 2552008117 is an apocalyptic number.
It is an amenable number.
552008117 is a deficient number, since it is larger than the sum of its proper divisors (1).
552008117 is an equidigital number, since it uses as much as digits as its factorization.
552008117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2800, while the sum is 29.
The square root of 552008117 is about 23494.8529895379. The cubic root of 552008117 is about 820.3172067433.
The spelling of 552008117 in words is "five hundred fifty-two million, eight thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •