Base | Representation |
---|---|
bin | 1001000110011001100101… |
… | …01000111000100000111111 |
3 | 2121212001011010020012210211 |
4 | 10203030302220320200333 |
5 | 10110330214131210421 |
6 | 110320550133013251 |
7 | 4133516524163245 |
oct | 443146250704077 |
9 | 77761133205724 |
10 | 20011102210111 |
11 | 641572a5668a1 |
12 | 22b2351784227 |
13 | b22067446b2c |
14 | 4d2784936795 |
15 | 24a8048b49e1 |
hex | 123332a3883f |
20011102210111 has 8 divisors (see below), whose sum is σ = 20053151672960. Its totient is φ = 19969056678168.
The previous prime is 20011102210091. The next prime is 20011102210171. The reversal of 20011102210111 is 11101220111002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20011102210111 - 27 = 20011102209983 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20011102210091 and 20011102210100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20011102210171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9322780 + ... + 11266606.
It is an arithmetic number, because the mean of its divisors is an integer number (2506643959120).
Almost surely, 220011102210111 is an apocalyptic number.
20011102210111 is a deficient number, since it is larger than the sum of its proper divisors (42049462849).
20011102210111 is a wasteful number, since it uses less digits than its factorization.
20011102210111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1965453.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20011102210111 its reverse (11101220111002), we get a palindrome (31112322321113).
The spelling of 20011102210111 in words is "twenty trillion, eleven billion, one hundred two million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •