Base | Representation |
---|---|
bin | 100000111110011… |
… | …000010011011101 |
3 | 1102112222122211011 |
4 | 200332120103131 |
5 | 2113111122024 |
6 | 130521255221 |
7 | 16465215115 |
oct | 4076302335 |
9 | 1375878734 |
10 | 553223389 |
11 | 264309a14 |
12 | 135334511 |
13 | 8a7cb724 |
14 | 5368c045 |
15 | 3387d094 |
hex | 20f984dd |
553223389 has 2 divisors, whose sum is σ = 553223390. Its totient is φ = 553223388.
The previous prime is 553223387. The next prime is 553223443. The reversal of 553223389 is 983322355.
It is a happy number.
553223389 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 364160889 + 189062500 = 19083^2 + 13750^2 .
It is a cyclic number.
It is not a de Polignac number, because 553223389 - 21 = 553223387 is a prime.
It is a super-2 number, since 2×5532233892 = 612112236273290642, which contains 22 as substring.
Together with 553223387, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (553223387) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276611694 + 276611695.
It is an arithmetic number, because the mean of its divisors is an integer number (276611695).
Almost surely, 2553223389 is an apocalyptic number.
It is an amenable number.
553223389 is a deficient number, since it is larger than the sum of its proper divisors (1).
553223389 is an equidigital number, since it uses as much as digits as its factorization.
553223389 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 194400, while the sum is 40.
The square root of 553223389 is about 23520.7012863137. The cubic root of 553223389 is about 820.9187545677.
The spelling of 553223389 in words is "five hundred fifty-three million, two hundred twenty-three thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •