Base | Representation |
---|---|
bin | 1010000011100001001001… |
… | …11111010010111010001111 |
3 | 2220021210122102112120012001 |
4 | 11001300210333102322033 |
5 | 10344232024211241421 |
6 | 115005412115253131 |
7 | 4441321654525216 |
oct | 501604477227217 |
9 | 86253572476161 |
10 | 22111112212111 |
11 | 70552a745439a |
12 | 25913468aa1a7 |
13 | c450b85b0380 |
14 | 56627d8cc07d |
15 | 285262905691 |
hex | 141c24fd2e8f |
22111112212111 has 8 divisors (see below), whose sum is σ = 23815293256160. Its totient is φ = 20407406347872.
The previous prime is 22111112212081. The next prime is 22111112212117. The reversal of 22111112212111 is 11121221111122.
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 22111112212111 - 223 = 22111103823503 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22111112212117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 118698300 + ... + 118884433.
It is an arithmetic number, because the mean of its divisors is an integer number (2976911657020).
Almost surely, 222111112212111 is an apocalyptic number.
22111112212111 is a deficient number, since it is larger than the sum of its proper divisors (1704181044049).
22111112212111 is a wasteful number, since it uses less digits than its factorization.
22111112212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 237589905.
The product of its digits is 32, while the sum is 19.
Adding to 22111112212111 its reverse (11121221111122), we get a palindrome (33232333323233).
The spelling of 22111112212111 in words is "twenty-two trillion, one hundred eleven billion, one hundred twelve million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •