Base | Representation |
---|---|
bin | 1010000000111111101110… |
… | …0101111010100100101111 |
3 | 1102222202110200212202220121 |
4 | 2200033323211322210233 |
5 | 2420411012340400421 |
6 | 35230540043425411 |
7 | 2214415063155646 |
oct | 240177345724457 |
9 | 42882420782817 |
10 | 11012222200111 |
11 | 3566291386840 |
12 | 129a2aab25267 |
13 | 61b5a9616822 |
14 | 2a0dcc8b435d |
15 | 1416be6bbd41 |
hex | a03fb97a92f |
11012222200111 has 8 divisors (see below), whose sum is σ = 12044215918800. Its totient is φ = 9985375583040.
The previous prime is 11012222200099. The next prime is 11012222200127. The reversal of 11012222200111 is 11100222221011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11012222200111 - 239 = 10462466386223 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11012222207111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1286770926 + ... + 1286779483.
It is an arithmetic number, because the mean of its divisors is an integer number (1505526989850).
Almost surely, 211012222200111 is an apocalyptic number.
11012222200111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11012222200111 is a deficient number, since it is larger than the sum of its proper divisors (1031993718689).
11012222200111 is a wasteful number, since it uses less digits than its factorization.
11012222200111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2573550809.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11012222200111 its reverse (11100222221011), we get a palindrome (22112444421122).
The spelling of 11012222200111 in words is "eleven trillion, twelve billion, two hundred twenty-two million, two hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •