Base | Representation |
---|---|
bin | 1010000110000111001000… |
… | …01111010101011101000011 |
3 | 2220121022122111221220211121 |
4 | 11003003210033111131003 |
5 | 10402212022333223021 |
6 | 115114350153053111 |
7 | 4450625103156403 |
oct | 503034417253503 |
9 | 86538574856747 |
10 | 22200220211011 |
11 | 708a073606897 |
12 | 25a66749b7197 |
13 | c50619679a3b |
14 | 56a6d4152803 |
15 | 28772a7d5741 |
hex | 1430e43d5743 |
22200220211011 has 4 divisors (see below), whose sum is σ = 22481235656800. Its totient is φ = 21919204765224.
The previous prime is 22200220210967. The next prime is 22200220211021. The reversal of 22200220211011 is 11011202200222.
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 22200220211011 - 215 = 22200220178243 is a prime.
It is a super-3 number, since 3×222002202110113 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22200220211021) 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, 140507722776 + ... + 140507722933.
It is an arithmetic number, because the mean of its divisors is an integer number (5620308914200).
Almost surely, 222200220211011 is an apocalyptic number.
22200220211011 is a deficient number, since it is larger than the sum of its proper divisors (281015445789).
22200220211011 is an equidigital number, since it uses as much as digits as its factorization.
22200220211011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 281015445788.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22200220211011 its reverse (11011202200222), we get a palindrome (33211422411233).
The spelling of 22200220211011 in words is "twenty-two trillion, two hundred billion, two hundred twenty million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •