Base | Representation |
---|---|
bin | 1001001001000010111010… |
… | …01110110100101010101111 |
3 | 2122011201210201100221002012 |
4 | 10210201131032310222233 |
5 | 10113322404321041421 |
6 | 110430423022151435 |
7 | 4143215401122665 |
oct | 444413516645257 |
9 | 78151721327065 |
10 | 20102011112111 |
11 | 645024023a465 |
12 | 2307aa2a2257b |
13 | b2a7c465b636 |
14 | 4d6d2a42ac35 |
15 | 24cd7592a95b |
hex | 12485d3b4aaf |
20102011112111 has 4 divisors (see below), whose sum is σ = 20279905015872. Its totient is φ = 19924117208352.
The previous prime is 20102011112087. The next prime is 20102011112137. The reversal of 20102011112111 is 11121111020102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20102011112111 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20102011111111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88946951711 + ... + 88946951936.
It is an arithmetic number, because the mean of its divisors is an integer number (5069976253968).
Almost surely, 220102011112111 is an apocalyptic number.
20102011112111 is a deficient number, since it is larger than the sum of its proper divisors (177893903761).
20102011112111 is a wasteful number, since it uses less digits than its factorization.
20102011112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177893903760.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 20102011112111 its reverse (11121111020102), we get a palindrome (31223122132213).
The spelling of 20102011112111 in words is "twenty trillion, one hundred two billion, eleven million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •