Base | Representation |
---|---|
bin | 1010000000111011100111… |
… | …1101100011110010111011 |
3 | 1102222122121221222012021111 |
4 | 2200032321331203302323 |
5 | 2420401234000231021 |
6 | 35230234511221151 |
7 | 2214345563040262 |
oct | 240167175436273 |
9 | 42878557865244 |
10 | 11011121102011 |
11 | 3565876891508 |
12 | 129a0422177b7 |
13 | 61b4624700a4 |
14 | 2a0d2656b5d9 |
15 | 141657bba8e1 |
hex | a03b9f63cbb |
11011121102011 has 2 divisors, whose sum is σ = 11011121102012. Its totient is φ = 11011121102010.
The previous prime is 11011121101979. The next prime is 11011121102071. The reversal of 11011121102011 is 11020112111011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11011121102011 - 25 = 11011121101979 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11011121101982 and 11011121102000.
It is not a weakly prime, because it can be changed into another prime (11011121102071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505560551005 + 5505560551006.
It is an arithmetic number, because the mean of its divisors is an integer number (5505560551006).
Almost surely, 211011121102011 is an apocalyptic number.
11011121102011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011121102011 is an equidigital number, since it uses as much as digits as its factorization.
11011121102011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 11011121102011 its reverse (11020112111011), we get a palindrome (22031233213022).
The spelling of 11011121102011 in words is "eleven trillion, eleven billion, one hundred twenty-one million, one hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •