Base | Representation |
---|---|
bin | 1001001001101000001010… |
… | …10001010100111100111111 |
3 | 2122020122102111012101000112 |
4 | 10210310011101110330333 |
5 | 10114134334103210421 |
6 | 110443531320220235 |
7 | 4144524112502105 |
oct | 444640521247477 |
9 | 78218374171015 |
10 | 20122010210111 |
11 | 6458773202827 |
12 | 230b94460a67b |
13 | b2c660aab834 |
14 | 4d7ca6559c75 |
15 | 24d64656945b |
hex | 124d05454f3f |
20122010210111 has 4 divisors (see below), whose sum is σ = 20125463452632. Its totient is φ = 20118556967592.
The previous prime is 20122010210087. The next prime is 20122010210161. The reversal of 20122010210111 is 11101201022102.
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 20122010210111 - 26 = 20122010210047 is a prime.
It is a super-2 number, since 2×201220102101112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20122010210161) 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, 1726612520 + ... + 1726624173.
It is an arithmetic number, because the mean of its divisors is an integer number (5031365863158).
Almost surely, 220122010210111 is an apocalyptic number.
20122010210111 is a deficient number, since it is larger than the sum of its proper divisors (3453242521).
20122010210111 is an equidigital number, since it uses as much as digits as its factorization.
20122010210111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3453242520.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20122010210111 its reverse (11101201022102), we get a palindrome (31223211232213).
The spelling of 20122010210111 in words is "twenty trillion, one hundred twenty-two billion, ten million, two hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •