Base | Representation |
---|---|
bin | 1001001001010101101101… |
… | …01001100010011101000011 |
3 | 2122012200211220200122000200 |
4 | 10210222312221202131003 |
5 | 10114004040403102321 |
6 | 110435212144220243 |
7 | 4144023421466415 |
oct | 444526651423503 |
9 | 78180756618020 |
10 | 20112101222211 |
11 | 6454548900529 |
12 | 2309a3a00a683 |
13 | b2b741c08b9b |
14 | 4d76065289b5 |
15 | 24d266687d26 |
hex | 124ab6a62743 |
20112101222211 has 24 divisors (see below), whose sum is σ = 30798420641664. Its totient is φ = 12624858650880.
The previous prime is 20112101222203. The next prime is 20112101222303. The reversal of 20112101222211 is 11222210121102.
20112101222211 is a `hidden beast` number, since 20 + 1 + 1 + 210 + 1 + 222 + 211 = 666.
It is not a de Polignac number, because 20112101222211 - 23 = 20112101222203 is a prime.
It is a super-2 number, since 2×201121012222112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20112101222201) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 974130006 + ... + 974150651.
It is an arithmetic number, because the mean of its divisors is an integer number (1283267526736).
Almost surely, 220112101222211 is an apocalyptic number.
20112101222211 is a deficient number, since it is larger than the sum of its proper divisors (10686319419453).
20112101222211 is a wasteful number, since it uses less digits than its factorization.
20112101222211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1948280731 (or 1948280728 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 20112101222211 its reverse (11222210121102), we get a palindrome (31334311343313).
The spelling of 20112101222211 in words is "twenty trillion, one hundred twelve billion, one hundred one million, two hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •