Base | Representation |
---|---|
bin | 1001000110000111001011… |
… | …01111010000100001101101 |
3 | 2121211002122120001200012111 |
4 | 10203003211233100201231 |
5 | 10110200000324213401 |
6 | 110312233512004021 |
7 | 4133016633506563 |
oct | 443034557204155 |
9 | 77732576050174 |
10 | 20001222101101 |
11 | 641151a49974a |
12 | 22b0454990611 |
13 | b21151545a97 |
14 | 4d20c86a1a33 |
15 | 24a4272d9e51 |
hex | 1230e5bd086d |
20001222101101 has 2 divisors, whose sum is σ = 20001222101102. Its totient is φ = 20001222101100.
The previous prime is 20001222101089. The next prime is 20001222101117. The reversal of 20001222101101 is 10110122210002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17481605572201 + 2519616528900 = 4181101^2 + 1587330^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001222101101 - 27 = 20001222100973 is a prime.
It is a super-2 number, since 2×200012221011012 (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 (20001222101141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000611050550 + 10000611050551.
It is an arithmetic number, because the mean of its divisors is an integer number (10000611050551).
Almost surely, 220001222101101 is an apocalyptic number.
It is an amenable number.
20001222101101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001222101101 is an equidigital number, since it uses as much as digits as its factorization.
20001222101101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20001222101101 its reverse (10110122210002), we get a palindrome (30111344311103).
The spelling of 20001222101101 in words is "twenty trillion, one billion, two hundred twenty-two million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •