Base | Representation |
---|---|
bin | 1010000011011111011111… |
… | …11011011010000001010011 |
3 | 2220021201100101110010000221 |
4 | 11001233233323122001103 |
5 | 10344223213313001321 |
6 | 115005143515053511 |
7 | 4441260625044232 |
oct | 501575773320123 |
9 | 86251311403027 |
10 | 22110222000211 |
11 | 705498a9a7a84 |
12 | 2591138741297 |
13 | c44ca6032c77 |
14 | 5661d759cb19 |
15 | 28520e6ade41 |
hex | 141befeda053 |
22110222000211 has 8 divisors (see below), whose sum is σ = 22341031463664. Its totient is φ = 21879645799200.
The previous prime is 22110222000203. The next prime is 22110222000241. The reversal of 22110222000211 is 11200022201122.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 22110222000211 - 23 = 22110222000203 is a prime.
It is a super-2 number, since 2×221102220002112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (22110222000241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58125045 + ... + 58504198.
It is an arithmetic number, because the mean of its divisors is an integer number (2792628932958).
Almost surely, 222110222000211 is an apocalyptic number.
22110222000211 is a deficient number, since it is larger than the sum of its proper divisors (230809463453).
22110222000211 is a wasteful number, since it uses less digits than its factorization.
22110222000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116631221.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 22110222000211 its reverse (11200022201122), we get a palindrome (33310244201333).
The spelling of 22110222000211 in words is "twenty-two trillion, one hundred ten billion, two hundred twenty-two million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •