Base | Representation |
---|---|
bin | 1001000110101101111010… |
… | …11001101101011010101111 |
3 | 2121220002100000100120110211 |
4 | 10203112331121231122233 |
5 | 10111020044132400421 |
6 | 110325553351243251 |
7 | 4134354216442006 |
oct | 443267531553257 |
9 | 77802300316424 |
10 | 20022020200111 |
11 | 641a322480326 |
12 | 22b449a079527 |
13 | b230b7389247 |
14 | 4d30dc979c3d |
15 | 24ac431549e1 |
hex | 1235bd66d6af |
20022020200111 has 4 divisors (see below), whose sum is σ = 20712434689800. Its totient is φ = 19331605710424.
The previous prime is 20022020200109. The next prime is 20022020200163. The reversal of 20022020200111 is 11100202022002.
It is a happy number.
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 20022020200111 - 21 = 20022020200109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20022020200091 and 20022020200100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022020200711) 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, 345207244801 + ... + 345207244858.
It is an arithmetic number, because the mean of its divisors is an integer number (5178108672450).
Almost surely, 220022020200111 is an apocalyptic number.
20022020200111 is a deficient number, since it is larger than the sum of its proper divisors (690414489689).
20022020200111 is an equidigital number, since it uses as much as digits as its factorization.
20022020200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 690414489688.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20022020200111 its reverse (11100202022002), we get a palindrome (31122222222113).
The spelling of 20022020200111 in words is "twenty trillion, twenty-two billion, twenty million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •