Base | Representation |
---|---|
bin | 1001001001010011101100… |
… | …01101011011010010101110 |
3 | 2122012121001120101111021112 |
4 | 10210221312031123102232 |
5 | 10113444332122023042 |
6 | 110434513004232022 |
7 | 4143654553263641 |
oct | 444516615332256 |
9 | 78177046344245 |
10 | 20111020111022 |
11 | 6454043617705 |
12 | 2309797b3b612 |
13 | b2b5cbc3c919 |
14 | 4d7542b05a58 |
15 | 24d2017d3982 |
hex | 124a7635b4ae |
20111020111022 has 4 divisors (see below), whose sum is σ = 30166530166536. Its totient is φ = 10055510055510.
The previous prime is 20111020110971. The next prime is 20111020111087. The reversal of 20111020111022 is 22011102011102.
It is a semiprime because it is the product of two primes.
It is a junction number, because it is equal to n+sod(n) for n = 20111020110988 and 20111020111006.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 5027755027754 + ... + 5027755027757.
It is an arithmetic number, because the mean of its divisors is an integer number (7541632541634).
Almost surely, 220111020111022 is an apocalyptic number.
20111020111022 is a deficient number, since it is larger than the sum of its proper divisors (10055510055514).
20111020111022 is a wasteful number, since it uses less digits than its factorization.
20111020111022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10055510055513.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20111020111022 its reverse (22011102011102), we get a palindrome (42122122122124).
It can be divided in two parts, 2011102011102 and 2, that multiplied together give a palindrome (4022204022204).
The spelling of 20111020111022 in words is "twenty trillion, one hundred eleven billion, twenty million, one hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •