Base | Representation |
---|---|
bin | 100000111110011… |
… | …111000100101001 |
3 | 1102120001001211222 |
4 | 200332133010221 |
5 | 2113113013423 |
6 | 130522031425 |
7 | 16465362002 |
oct | 4076370451 |
9 | 1376031758 |
10 | 553251113 |
11 | 264328828 |
12 | 135348575 |
13 | 8a80b22c |
14 | 536981a9 |
15 | 338863c8 |
hex | 20f9f129 |
553251113 has 2 divisors, whose sum is σ = 553251114. Its totient is φ = 553251112.
The previous prime is 553251109. The next prime is 553251119. The reversal of 553251113 is 311152355.
It is a happy number.
553251113 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., 463627024 + 89624089 = 21532^2 + 9467^2 .
It is a cyclic number.
It is not a de Polignac number, because 553251113 - 22 = 553251109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is equal to p29007251 and since 553251113 and 29007251 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (553251119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 276625556 + 276625557.
It is an arithmetic number, because the mean of its divisors is an integer number (276625557).
Almost surely, 2553251113 is an apocalyptic number.
It is an amenable number.
553251113 is a deficient number, since it is larger than the sum of its proper divisors (1).
553251113 is an equidigital number, since it uses as much as digits as its factorization.
553251113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2250, while the sum is 26.
The square root of 553251113 is about 23521.2906321061. The cubic root of 553251113 is about 820.9324673956.
The spelling of 553251113 in words is "five hundred fifty-three million, two hundred fifty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •