Base | Representation |
---|---|
bin | 1001001001010110000110… |
… | …01010001100110111011011 |
3 | 2122012201101112122002111101 |
4 | 10210223003022030313123 |
5 | 10114010003121024011 |
6 | 110435245043012231 |
7 | 4144031550511441 |
oct | 444530312146733 |
9 | 78181345562441 |
10 | 20112311111131 |
11 | 6454646328148 |
12 | 2309a9836a077 |
13 | b2b776546305 |
14 | 4d7626362b91 |
15 | 24d279ce72c1 |
hex | 124ac328cddb |
20112311111131 has 2 divisors, whose sum is σ = 20112311111132. Its totient is φ = 20112311111130.
The previous prime is 20112311111129. The next prime is 20112311111203. The reversal of 20112311111131 is 13111111321102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20112311111131 - 21 = 20112311111129 is a prime.
It is a super-2 number, since 2×201123111111312 (a number of 27 digits) contains 22 as substring.
Together with 20112311111129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 20112311111099 and 20112311111108.
It is not a weakly prime, because it can be changed into another prime (20112311114131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056155555565 + 10056155555566.
It is an arithmetic number, because the mean of its divisors is an integer number (10056155555566).
Almost surely, 220112311111131 is an apocalyptic number.
20112311111131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112311111131 is an equidigital number, since it uses as much as digits as its factorization.
20112311111131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 36, while the sum is 19.
Adding to 20112311111131 its reverse (13111111321102), we get a palindrome (33223422432233).
The spelling of 20112311111131 in words is "twenty trillion, one hundred twelve billion, three hundred eleven million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •