Base | Representation |
---|---|
bin | 1001001001010011101011… |
… | …00111010001101010010101 |
3 | 2122012121000212120101121001 |
4 | 10210221311213101222111 |
5 | 10113444322042010401 |
6 | 110434512010023301 |
7 | 4143654402261511 |
oct | 444516547215225 |
9 | 78177025511531 |
10 | 20111010110101 |
11 | 6454038a06889 |
12 | 2309794717b31 |
13 | b2b5c9b4a811 |
14 | 4d7541661141 |
15 | 24d2009aa601 |
hex | 124a759d1a95 |
20111010110101 has 2 divisors, whose sum is σ = 20111010110102. Its totient is φ = 20111010110100.
The previous prime is 20111010110089. The next prime is 20111010110143. The reversal of 20111010110101 is 10101101011102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14329245589201 + 5781764520900 = 3785399^2 + 2404530^2 .
It is a cyclic number.
It is not a de Polignac number, because 20111010110101 - 211 = 20111010108053 is a prime.
It is a super-2 number, since 2×201110101101012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111010110161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055505055050 + 10055505055051.
It is an arithmetic number, because the mean of its divisors is an integer number (10055505055051).
Almost surely, 220111010110101 is an apocalyptic number.
It is an amenable number.
20111010110101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111010110101 is an equidigital number, since it uses as much as digits as its factorization.
20111010110101 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 10.
Adding to 20111010110101 its reverse (10101101011102), we get a palindrome (30212111121203).
The spelling of 20111010110101 in words is "twenty trillion, one hundred eleven billion, ten million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •