Base | Representation |
---|---|
bin | 1010000110000111100000… |
… | …1001000000100010110111 |
3 | 1110022011120210120001011220 |
4 | 2201201320021000202313 |
5 | 2423331213021322221 |
6 | 35335211103401423 |
7 | 2223651402513045 |
oct | 241417011004267 |
9 | 43264523501156 |
10 | 11100211120311 |
11 | 359a633882905 |
12 | 12b33662b3273 |
13 | 62698c8b2551 |
14 | 2a5378671395 |
15 | 143b1e1e80c6 |
hex | a18782408b7 |
11100211120311 has 4 divisors (see below), whose sum is σ = 14800281493752. Its totient is φ = 7400140746872.
The previous prime is 11100211120259. The next prime is 11100211120381. The reversal of 11100211120311 is 11302111200111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11100211120311 - 27 = 11100211120183 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100211120381) 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 3 ways as a sum of consecutive naturals, for example, 1850035186716 + ... + 1850035186721.
It is an arithmetic number, because the mean of its divisors is an integer number (3700070373438).
Almost surely, 211100211120311 is an apocalyptic number.
11100211120311 is a deficient number, since it is larger than the sum of its proper divisors (3700070373441).
11100211120311 is an equidigital number, since it uses as much as digits as its factorization.
11100211120311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3700070373440.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 11100211120311 its reverse (11302111200111), we get a palindrome (22402322320422).
The spelling of 11100211120311 in words is "eleven trillion, one hundred billion, two hundred eleven million, one hundred twenty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •