Base | Representation |
---|---|
bin | 1010000000010010001100… |
… | …1110011001000001001111 |
3 | 1102221120221001211110201202 |
4 | 2200010203032121001033 |
5 | 2420211001032020421 |
6 | 35221155315100115 |
7 | 2213503211101052 |
oct | 240044316310117 |
9 | 42846831743652 |
10 | 11000002220111 |
11 | 3561090535a13 |
12 | 1297a5a5a163b |
13 | 61a3aca20728 |
14 | 2a058d992a99 |
15 | 14120699710b |
hex | a012339904f |
11000002220111 has 16 divisors (see below), whose sum is σ = 11650703034240. Its totient is φ = 10356484612320.
The previous prime is 11000002220101. The next prime is 11000002220167. The reversal of 11000002220111 is 11102220000011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11000002220111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11000002220092 and 11000002220101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11000002220101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 54663821 + ... + 54864681.
It is an arithmetic number, because the mean of its divisors is an integer number (728168939640).
Almost surely, 211000002220111 is an apocalyptic number.
11000002220111 is a deficient number, since it is larger than the sum of its proper divisors (650700814129).
11000002220111 is a wasteful number, since it uses less digits than its factorization.
11000002220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218726.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11000002220111 its reverse (11102220000011), we get a palindrome (22102222220122).
The spelling of 11000002220111 in words is "eleven trillion, two million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •