Base | Representation |
---|---|
bin | 1001001001010011110110… |
… | …00010011010101101000111 |
3 | 2122012121021012210201111211 |
4 | 10210221323002122231013 |
5 | 10114000013341023421 |
6 | 110434525020312251 |
7 | 4143656555623543 |
oct | 444517302325507 |
9 | 78177235721454 |
10 | 20111101111111 |
11 | 645408531122a |
12 | 23097bb0a2687 |
13 | b2b61296027a |
14 | 4d754d78ca23 |
15 | 24d2089839e1 |
hex | 124a7b09ab47 |
20111101111111 has 2 divisors, whose sum is σ = 20111101111112. Its totient is φ = 20111101111110.
The previous prime is 20111101111091. The next prime is 20111101111147. The reversal of 20111101111111 is 11111110111102.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 20111101111111 - 27 = 20111101110983 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20111101111091 and 20111101111100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111101111151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055550555555 + 10055550555556.
It is an arithmetic number, because the mean of its divisors is an integer number (10055550555556).
Almost surely, 220111101111111 is an apocalyptic number.
20111101111111 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111101111111 is an equidigital number, since it uses as much as digits as its factorization.
20111101111111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 13.
Adding to 20111101111111 its reverse (11111110111102), we get a palindrome (31222211222213).
The spelling of 20111101111111 in words is "twenty trillion, one hundred eleven billion, one hundred one million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •