Base | Representation |
---|---|
bin | 1010000110001010011100… |
… | …1110111011000110001011 |
3 | 1110022020121212020020210000 |
4 | 2201202213032323012023 |
5 | 2423334322301400021 |
6 | 35335421325454043 |
7 | 2224010105211312 |
oct | 241424716730613 |
9 | 43266555206700 |
10 | 11101001200011 |
11 | 359a9a9858438 |
12 | 12b3546a11323 |
13 | 626a874a0c28 |
14 | 2a5411577279 |
15 | 143b68760b26 |
hex | a18a73bb18b |
11101001200011 has 20 divisors (see below), whose sum is σ = 16583181655744. Its totient is φ = 7400576178000.
The previous prime is 11101001199973. The next prime is 11101001200019. The reversal of 11101001200011 is 11000210010111.
11101001200011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-11101001200011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11101001199966 and 11101001200002.
It is not an unprimeable number, because it can be changed into a prime (11101001200019) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 6113286 + ... + 7718436.
Almost surely, 211101001200011 is an apocalyptic number.
11101001200011 is a deficient number, since it is larger than the sum of its proper divisors (5482180455733).
11101001200011 is an equidigital number, since it uses as much as digits as its factorization.
11101001200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1690544 (or 1690535 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 11101001200011 its reverse (11000210010111), we get a palindrome (22101211210122).
The spelling of 11101001200011 in words is "eleven trillion, one hundred one billion, one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •