Base | Representation |
---|---|
bin | 1001000110000110110010… |
… | …01010011011011111101111 |
3 | 2121211002002212001201200202 |
4 | 10203003121022123133233 |
5 | 10110144032321320421 |
6 | 110312200533544115 |
7 | 4133011462265630 |
oct | 443033112333757 |
9 | 77732085051622 |
10 | 20001011120111 |
11 | 641142139659a |
12 | 22b03b61a503b |
13 | b21119915568 |
14 | 4d20a8661887 |
15 | 24a413a1210b |
hex | 1230d929b7ef |
20001011120111 has 4 divisors (see below), whose sum is σ = 22858298422992. Its totient is φ = 17143723817232.
The previous prime is 20001011120087. The next prime is 20001011120149. The reversal of 20001011120111 is 11102111010002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20001011120111 - 230 = 19999937378287 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20001011120092 and 20001011120101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001011120161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1428643651430 + ... + 1428643651443.
It is an arithmetic number, because the mean of its divisors is an integer number (5714574605748).
Almost surely, 220001011120111 is an apocalyptic number.
20001011120111 is a deficient number, since it is larger than the sum of its proper divisors (2857287302881).
20001011120111 is an equidigital number, since it uses as much as digits as its factorization.
20001011120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2857287302880.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 20001011120111 its reverse (11102111010002), we get a palindrome (31103122130113).
The spelling of 20001011120111 in words is "twenty trillion, one billion, eleven million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •