Base | Representation |
---|---|
bin | 100000111001110… |
… | …011011000101101 |
3 | 1102110201201000102 |
4 | 200321303120231 |
5 | 2112304223342 |
6 | 130435440445 |
7 | 16452060146 |
oct | 4071633055 |
9 | 1373651012 |
10 | 552023597 |
11 | 26366a554 |
12 | 134a56125 |
13 | 8a49b5a8 |
14 | 53458acd |
15 | 336e2832 |
hex | 20e7362d |
552023597 has 2 divisors, whose sum is σ = 552023598. Its totient is φ = 552023596.
The previous prime is 552023573. The next prime is 552023599. The reversal of 552023597 is 795320255.
552023597 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 450033796 + 101989801 = 21214^2 + 10099^2 .
It is a cyclic number.
It is not a de Polignac number, because 552023597 - 26 = 552023533 is a prime.
Together with 552023599, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 552023597.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (552023599) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276011798 + 276011799.
It is an arithmetic number, because the mean of its divisors is an integer number (276011799).
Almost surely, 2552023597 is an apocalyptic number.
It is an amenable number.
552023597 is a deficient number, since it is larger than the sum of its proper divisors (1).
552023597 is an equidigital number, since it uses as much as digits as its factorization.
552023597 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 94500, while the sum is 38.
The square root of 552023597 is about 23495.1824210837. The cubic root of 552023597 is about 820.3248747415.
The spelling of 552023597 in words is "five hundred fifty-two million, twenty-three thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •