Base | Representation |
---|---|
bin | 1010000000010100001111… |
… | …10100001101100000110111 |
3 | 2212220021200120020002101110 |
4 | 11000022013310031200313 |
5 | 10340431223340213421 |
6 | 114443055531330103 |
7 | 4430345536520166 |
oct | 500120764154067 |
9 | 85807616202343 |
10 | 22001101101111 |
11 | 7012684005440 |
12 | 2573b642b0933 |
13 | c379059c3012 |
14 | 560c050553dd |
15 | 282474865a76 |
hex | 140287d0d837 |
22001101101111 has 16 divisors (see below), whose sum is σ = 33105105106560. Its totient is φ = 12874207540320.
The previous prime is 22001101101059. The next prime is 22001101101233. The reversal of 22001101101111 is 11110110110022.
It is not a de Polignac number, because 22001101101111 - 211 = 22001101099063 is a prime.
It is a super-2 number, since 2×220011011011112 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22001101108111) 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, 11494827205 + ... + 11494829118.
It is an arithmetic number, because the mean of its divisors is an integer number (2069069069160).
Almost surely, 222001101101111 is an apocalyptic number.
22001101101111 is a deficient number, since it is larger than the sum of its proper divisors (11104004005449).
22001101101111 is a wasteful number, since it uses less digits than its factorization.
22001101101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22989656366.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 22001101101111 its reverse (11110110110022), we get a palindrome (33111211211133).
The spelling of 22001101101111 in words is "twenty-two trillion, one billion, one hundred one million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •