Base | Representation |
---|---|
bin | 1010001101001001100011… |
… | …1011001001101011001111 |
3 | 1110201201102012012011221121 |
4 | 2203102120323021223033 |
5 | 2432321122134020421 |
6 | 35510510541541411 |
7 | 2235456225102022 |
oct | 243223073115317 |
9 | 43651365164847 |
10 | 11221020220111 |
11 | 3636898423649 |
12 | 1312860b74867 |
13 | 6351a35b76a0 |
14 | 2ab1592311b9 |
15 | 146d40221d41 |
hex | a3498ec9acf |
11221020220111 has 16 divisors (see below), whose sum is σ = 12264797641600. Its totient is φ = 10203052530528.
The previous prime is 11221020220103. The next prime is 11221020220121. The reversal of 11221020220111 is 11102202012211.
It is not a de Polignac number, because 11221020220111 - 23 = 11221020220103 is a prime.
It is a super-2 number, since 2×112210202201112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11221020220121) 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, 52273960 + ... + 52488178.
It is an arithmetic number, because the mean of its divisors is an integer number (766549852600).
Almost surely, 211221020220111 is an apocalyptic number.
11221020220111 is a deficient number, since it is larger than the sum of its proper divisors (1043777421489).
11221020220111 is a wasteful number, since it uses less digits than its factorization.
11221020220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274438.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11221020220111 its reverse (11102202012211), we get a palindrome (22323222232322).
The spelling of 11221020220111 in words is "eleven trillion, two hundred twenty-one billion, twenty million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •