Base | Representation |
---|---|
bin | 11101010001010001000… |
… | …001101110100111110011 |
3 | 21010021210012200021010002 |
4 | 131101101001232213303 |
5 | 230423323422232011 |
6 | 4140005402300215 |
7 | 265214316526154 |
oct | 35212101564763 |
9 | 7107705607102 |
10 | 2011404102131 |
11 | 7060391a6586 |
12 | 2859a71b766b |
13 | 1178a01084b8 |
14 | 6d4d12b192b |
15 | 374c4290c3b |
hex | 1d45106e9f3 |
2011404102131 has 2 divisors, whose sum is σ = 2011404102132. Its totient is φ = 2011404102130.
The previous prime is 2011404102091. The next prime is 2011404102161. The reversal of 2011404102131 is 1312014041102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011404102131 is a prime.
It is a super-2 number, since 2×20114041021312 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (2011404102161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005702051065 + 1005702051066.
It is an arithmetic number, because the mean of its divisors is an integer number (1005702051066).
Almost surely, 22011404102131 is an apocalyptic number.
2011404102131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011404102131 is an equidigital number, since it uses as much as digits as its factorization.
2011404102131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 2011404102131 its reverse (1312014041102), we get a palindrome (3323418143233).
The spelling of 2011404102131 in words is "two trillion, eleven billion, four hundred four million, one hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •