Base | Representation |
---|---|
bin | 1010000011001100110101… |
… | …01100100001110101011111 |
3 | 2220020202111002020112211220 |
4 | 11001212122230201311133 |
5 | 10344042203214231421 |
6 | 115000405341544423 |
7 | 4440454416236310 |
oct | 501463254416537 |
9 | 86222432215756 |
10 | 22100202102111 |
11 | 7050708a32261 |
12 | 258b200b75113 |
13 | c4406a199893 |
14 | 56592693a607 |
15 | 284d24bc03c6 |
hex | 14199ab21d5f |
22100202102111 has 16 divisors (see below), whose sum is σ = 33697989556224. Its totient is φ = 12620627747424.
The previous prime is 22100202102061. The next prime is 22100202102113. The reversal of 22100202102111 is 11120120200122.
It is not a de Polignac number, because 22100202102111 - 214 = 22100202085727 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22100202102113) 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 15 ways as a sum of consecutive naturals, for example, 335764980 + ... + 335830793.
It is an arithmetic number, because the mean of its divisors is an integer number (2106124347264).
Almost surely, 222100202102111 is an apocalyptic number.
22100202102111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
22100202102111 is a deficient number, since it is larger than the sum of its proper divisors (11597787454113).
22100202102111 is a wasteful number, since it uses less digits than its factorization.
22100202102111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671597350.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 22100202102111 its reverse (11120120200122), we get a palindrome (33220322302233).
The spelling of 22100202102111 in words is "twenty-two trillion, one hundred billion, two hundred two million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •