Base | Representation |
---|---|
bin | 1010000000111011100111… |
… | …1101100110010010010011 |
3 | 1102222122121221222201021021 |
4 | 2200032321331212102103 |
5 | 2420401234001042321 |
6 | 35230234511340311 |
7 | 2214345563112103 |
oct | 240167175462223 |
9 | 42878557881237 |
10 | 11011121112211 |
11 | 3565876899140 |
12 | 129a042221697 |
13 | 61b46247491c |
14 | 2a0d26571203 |
15 | 141657bbd941 |
hex | a03b9f66493 |
11011121112211 has 32 divisors (see below), whose sum is σ = 12241789781760. Its totient is φ = 9820811952000.
The previous prime is 11011121112191. The next prime is 11011121112227. The reversal of 11011121112211 is 11221112111011.
11011121112211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11011121112211 - 243 = 2215028090003 is a prime.
It is not an unprimeable number, because it can be changed into a prime (11011121112281) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 80698201 + ... + 80834533.
It is an arithmetic number, because the mean of its divisors is an integer number (382555930680).
Almost surely, 211011121112211 is an apocalyptic number.
11011121112211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11011121112211 is a deficient number, since it is larger than the sum of its proper divisors (1230668669549).
11011121112211 is a wasteful number, since it uses less digits than its factorization.
11011121112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 137107.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 11011121112211 its reverse (11221112111011), we get a palindrome (22232233223222).
The spelling of 11011121112211 in words is "eleven trillion, eleven billion, one hundred twenty-one million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •