Base | Representation |
---|---|
bin | 1001001001010011110110… |
… | …00010110011010111100011 |
3 | 2122012121021012222212002022 |
4 | 10210221323002303113203 |
5 | 10114000013402242011 |
6 | 110434525022412055 |
7 | 4143656556524216 |
oct | 444517302632743 |
9 | 78177235885068 |
10 | 20111101212131 |
11 | 6454085380116 |
12 | 23097bb13102b |
13 | b2b612997247 |
14 | 4d754d7b777d |
15 | 24d2089a38db |
hex | 124a7b0b35e3 |
20111101212131 has 2 divisors, whose sum is σ = 20111101212132. Its totient is φ = 20111101212130.
The previous prime is 20111101212109. The next prime is 20111101212143. The reversal of 20111101212131 is 13121210111102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20111101212131 - 210 = 20111101211107 is a prime.
It is a super-2 number, since 2×201111012121312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20111101212031) 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, 10055550606065 + 10055550606066.
It is an arithmetic number, because the mean of its divisors is an integer number (10055550606066).
Almost surely, 220111101212131 is an apocalyptic number.
20111101212131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111101212131 is an equidigital number, since it uses as much as digits as its factorization.
20111101212131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 17.
Adding to 20111101212131 its reverse (13121210111102), we get a palindrome (33232311323233).
The spelling of 20111101212131 in words is "twenty trillion, one hundred eleven billion, one hundred one million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •