Base | Representation |
---|---|
bin | 1001001001101000001001… |
… | …01010011000010001101111 |
3 | 2122020122101202222122112101 |
4 | 10210310010222120101233 |
5 | 10114134324000000421 |
6 | 110443530313315531 |
7 | 4144523626636252 |
oct | 444640452302157 |
9 | 78218352878471 |
10 | 20122000000111 |
11 | 6458768469909 |
12 | 230b941105ba7 |
13 | b2c65b945509 |
14 | 4d7ca505d099 |
15 | 24d6456ee191 |
hex | 124d04a9846f |
20122000000111 has 4 divisors (see below), whose sum is σ = 20212233184192. Its totient is φ = 20031766816032.
The previous prime is 20122000000099. The next prime is 20122000000163. The reversal of 20122000000111 is 11100000022102.
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 20122000000111 - 25 = 20122000000079 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 (20122000003111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45116591706 + ... + 45116592151.
It is an arithmetic number, because the mean of its divisors is an integer number (5053058296048).
Almost surely, 220122000000111 is an apocalyptic number.
20122000000111 is a deficient number, since it is larger than the sum of its proper divisors (90233184081).
20122000000111 is an equidigital number, since it uses as much as digits as its factorization.
20122000000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90233184080.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20122000000111 its reverse (11100000022102), we get a palindrome (31222000022213).
The spelling of 20122000000111 in words is "twenty trillion, one hundred twenty-two billion, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •