Base | Representation |
---|---|
bin | 1010000011100010111111… |
… | …11000001111110011001111 |
3 | 2220021220012021122120100221 |
4 | 11001301133320033303033 |
5 | 10344241040124020421 |
6 | 115010054131532211 |
7 | 4441355312462056 |
oct | 501613770176317 |
9 | 86256167576327 |
10 | 22112100220111 |
11 | 7055764127430 |
12 | 259158175a067 |
13 | c452151ac0a5 |
14 | 566334bd739d |
15 | 2852be518841 |
hex | 141c5fe0fccf |
22112100220111 has 4 divisors (see below), whose sum is σ = 24122291149224. Its totient is φ = 20101909291000.
The previous prime is 22112100220073. The next prime is 22112100220121. The reversal of 22112100220111 is 11102200121122.
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 22112100220111 - 215 = 22112100187343 is a prime.
It is a super-2 number, since 2×221121002201112 (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 (22112100220121) 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, 1005095464540 + ... + 1005095464561.
It is an arithmetic number, because the mean of its divisors is an integer number (6030572787306).
Almost surely, 222112100220111 is an apocalyptic number.
22112100220111 is a deficient number, since it is larger than the sum of its proper divisors (2010190929113).
22112100220111 is a wasteful number, since it uses less digits than its factorization.
22112100220111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2010190929112.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 22112100220111 its reverse (11102200121122), we get a palindrome (33214300341233).
The spelling of 22112100220111 in words is "twenty-two trillion, one hundred twelve billion, one hundred million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •