Base | Representation |
---|---|
bin | 11101010000111111100… |
… | …001101101101010100011 |
3 | 21010021000202012120111102 |
4 | 131100333201231222203 |
5 | 230422223241400211 |
6 | 4135520313305015 |
7 | 265204123112264 |
oct | 35207741555243 |
9 | 7107022176442 |
10 | 2011110496931 |
11 | 7059a849a658 |
12 | 285924a0516b |
13 | 117854339303 |
14 | 6d4a42c496b |
15 | 374a85e6a3b |
hex | 1d43f86daa3 |
2011110496931 has 2 divisors, whose sum is σ = 2011110496932. Its totient is φ = 2011110496930.
The previous prime is 2011110496921. The next prime is 2011110496937. The reversal of 2011110496931 is 1396940111102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011110496931 is a prime.
It is a super-2 number, since 2×20111104969312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2011110496937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005555248465 + 1005555248466.
It is an arithmetic number, because the mean of its divisors is an integer number (1005555248466).
Almost surely, 22011110496931 is an apocalyptic number.
2011110496931 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011110496931 is an equidigital number, since it uses as much as digits as its factorization.
2011110496931 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 38.
The spelling of 2011110496931 in words is "two trillion, eleven billion, one hundred ten million, four hundred ninety-six thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •