Base | Representation |
---|---|
bin | 1001001001010011101011… |
… | …01011011110001101111111 |
3 | 2122012121000221122021112011 |
4 | 10210221311223132031333 |
5 | 10113444322332210421 |
6 | 110434512045352051 |
7 | 4143654414522523 |
oct | 444516553361577 |
9 | 78177027567464 |
10 | 20111011210111 |
11 | 6454039598288 |
12 | 2309794b68627 |
13 | b2b5ca144403 |
14 | 4d7541869d83 |
15 | 24d200b264e1 |
hex | 124a75ade37f |
20111011210111 has 4 divisors (see below), whose sum is σ = 20143606042512. Its totient is φ = 20078416377712.
The previous prime is 20111011210093. The next prime is 20111011210217. The reversal of 20111011210111 is 11101211011102.
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 20111011210111 - 215 = 20111011177343 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20111011210091 and 20111011210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111011217111) 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, 16297415275 + ... + 16297416508.
It is an arithmetic number, because the mean of its divisors is an integer number (5035901510628).
Almost surely, 220111011210111 is an apocalyptic number.
20111011210111 is a deficient number, since it is larger than the sum of its proper divisors (32594832401).
20111011210111 is an equidigital number, since it uses as much as digits as its factorization.
20111011210111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32594832400.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 20111011210111 its reverse (11101211011102), we get a palindrome (31212222221213).
The spelling of 20111011210111 in words is "twenty trillion, one hundred eleven billion, eleven million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •