Base | Representation |
---|---|
bin | 111011111011101… |
… | …1110011000001101 |
3 | 12012011002221222121 |
4 | 1313313132120031 |
5 | 13104310443203 |
6 | 531315212541 |
7 | 100556324203 |
oct | 16767363015 |
9 | 5164087877 |
10 | 2011031053 |
11 | 9421a1439 |
12 | 4815a7151 |
13 | 26083a305 |
14 | 15112b073 |
15 | bb8410bd |
hex | 77dde60d |
2011031053 has 2 divisors, whose sum is σ = 2011031054. Its totient is φ = 2011031052.
The previous prime is 2011031021. The next prime is 2011031069. The reversal of 2011031053 is 3501301102.
It is an a-pointer prime, because the next prime (2011031069) can be obtained adding 2011031053 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1233625129 + 777405924 = 35123^2 + 27882^2 .
It is a cyclic number.
It is not a de Polignac number, because 2011031053 - 25 = 2011031021 is a prime.
It is a super-2 number, since 2×20110310532 = 8088491792260577618, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2011031453) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005515526 + 1005515527.
It is an arithmetic number, because the mean of its divisors is an integer number (1005515527).
Almost surely, 22011031053 is an apocalyptic number.
It is an amenable number.
2011031053 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011031053 is an equidigital number, since it uses as much as digits as its factorization.
2011031053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 2011031053 is about 44844.5208804822. The cubic root of 2011031053 is about 1262.2331801983.
Adding to 2011031053 its reverse (3501301102), we get a palindrome (5512332155).
The spelling of 2011031053 in words is "two billion, eleven million, thirty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •