Base | Representation |
---|---|
bin | 1010000011100001001000… |
… | …10001000110010101111011 |
3 | 2220021210121120202022020211 |
4 | 11001300210101012111323 |
5 | 10344232013111231021 |
6 | 115005411003531551 |
7 | 4441321446556624 |
oct | 501604421062573 |
9 | 86253546668224 |
10 | 22111100102011 |
11 | 70552a0632948 |
12 | 2591342829bb7 |
13 | c450b5c3022b |
14 | 56627c058a4b |
15 | 2852618123e1 |
hex | 141c2444657b |
22111100102011 has 16 divisors (see below), whose sum is σ = 22620816025600. Its totient is φ = 21607319099520.
The previous prime is 22111100101991. The next prime is 22111100102041. The reversal of 22111100102011 is 11020100111122.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 22111100102011 - 215 = 22111100069243 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22111100101982 and 22111100102000.
It is not an unprimeable number, because it can be changed into a prime (22111100102041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2032726 + ... + 6953716.
It is an arithmetic number, because the mean of its divisors is an integer number (1413801001600).
Almost surely, 222111100102011 is an apocalyptic number.
22111100102011 is a deficient number, since it is larger than the sum of its proper divisors (509715923589).
22111100102011 is a wasteful number, since it uses less digits than its factorization.
22111100102011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4921594.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 22111100102011 its reverse (11020100111122), we get a palindrome (33131200213133).
The spelling of 22111100102011 in words is "twenty-two trillion, one hundred eleven billion, one hundred million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •