Base | Representation |
---|---|
bin | 1010000110000111100000… |
… | …1001010100000011010011 |
3 | 1110022011120210201002210011 |
4 | 2201201320021110003103 |
5 | 2423331213031401321 |
6 | 35335211105215351 |
7 | 2223651403265020 |
oct | 241417011240323 |
9 | 43264523632704 |
10 | 11100211200211 |
11 | 359a633927941 |
12 | 12b3366331557 |
13 | 62698c90ca23 |
14 | 2a5378692547 |
15 | 143b1e211ae1 |
hex | a18782540d3 |
11100211200211 has 32 divisors (see below), whose sum is σ = 12920146444800. Its totient is φ = 9339830413056.
The previous prime is 11100211200139. The next prime is 11100211200217. The reversal of 11100211200211 is 11200211200111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 11100211200211 - 29 = 11100211199699 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11100211200191 and 11100211200200.
It is not an unprimeable number, because it can be changed into a prime (11100211200217) 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 31 ways as a sum of consecutive naturals, for example, 638411460 + ... + 638428846.
It is an arithmetic number, because the mean of its divisors is an integer number (403754576400).
Almost surely, 211100211200211 is an apocalyptic number.
11100211200211 is a deficient number, since it is larger than the sum of its proper divisors (1819935244589).
11100211200211 is a wasteful number, since it uses less digits than its factorization.
11100211200211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22123.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 11100211200211 its reverse (11200211200111), we get a palindrome (22300422400322).
The spelling of 11100211200211 in words is "eleven trillion, one hundred billion, two hundred eleven million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •