Base | Representation |
---|---|
bin | 1001000110101110010010… |
… | …11100010100100000100111 |
3 | 2121220002212002110210110201 |
4 | 10203113021130110200213 |
5 | 10111021002341223421 |
6 | 110330025405131331 |
7 | 4134362221503241 |
oct | 443271134244047 |
9 | 77802762423421 |
10 | 20022222211111 |
11 | 641a41650716a |
12 | 22b4535859b47 |
13 | b2311a198993 |
14 | 4d311b723091 |
15 | 24ac55c59b91 |
hex | 1235c9714827 |
20022222211111 has 4 divisors (see below), whose sum is σ = 20487855285832. Its totient is φ = 19556589136392.
The previous prime is 20022222211049. The next prime is 20022222211141. The reversal of 20022222211111 is 11111222222002.
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 20022222211111 - 27 = 20022222210983 is a prime.
It is a super-2 number, since 2×200222222111112 (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 (20022222211141) 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, 232816537296 + ... + 232816537381.
It is an arithmetic number, because the mean of its divisors is an integer number (5121963821458).
Almost surely, 220022222211111 is an apocalyptic number.
20022222211111 is a deficient number, since it is larger than the sum of its proper divisors (465633074721).
20022222211111 is an equidigital number, since it uses as much as digits as its factorization.
20022222211111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 465633074720.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 20022222211111 its reverse (11111222222002), we get a palindrome (31133444433113).
The spelling of 20022222211111 in words is "twenty trillion, twenty-two billion, two hundred twenty-two million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •