Base | Representation |
---|---|
bin | 11101010000111111000… |
… | …001010101111011111011 |
3 | 21010021000011020110011112 |
4 | 131100333001111323323 |
5 | 230422214103324011 |
6 | 4135515411350535 |
7 | 265203661020323 |
oct | 35207701257373 |
9 | 7107004213145 |
10 | 2011102011131 |
11 | 7059a37240a4 |
12 | 285921bb244b |
13 | 117852657a25 |
14 | 6d4a3116283 |
15 | 374a79bc58b |
hex | 1d43f055efb |
2011102011131 has 2 divisors, whose sum is σ = 2011102011132. Its totient is φ = 2011102011130.
The previous prime is 2011102011101. The next prime is 2011102011161. The reversal of 2011102011131 is 1311102011102.
It is a balanced prime because it is at equal distance from previous prime (2011102011101) and next prime (2011102011161).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2011102011131 is a prime.
It is a super-2 number, since 2×20111020111312 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2011102011101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1005551005565 + 1005551005566.
It is an arithmetic number, because the mean of its divisors is an integer number (1005551005566).
Almost surely, 22011102011131 is an apocalyptic number.
2011102011131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2011102011131 is an equidigital number, since it uses as much as digits as its factorization.
2011102011131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 2011102011131 its reverse (1311102011102), we get a palindrome (3322204022233).
The spelling of 2011102011131 in words is "two trillion, eleven billion, one hundred two million, eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •