Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …1010111000000111100011 |
3 | 1102222122121022212021200011 |
4 | 2200032321122320013203 |
5 | 2420401224133311321 |
6 | 35230233544305351 |
7 | 2214345422542465 |
oct | 240167132700743 |
9 | 42878538767604 |
10 | 11011112010211 |
11 | 3565871741725 |
12 | 129a03b172257 |
13 | 61b460608a21 |
14 | 2a0d25282135 |
15 | 141656ec1ae1 |
hex | a03b96b81e3 |
11011112010211 has 2 divisors, whose sum is σ = 11011112010212. Its totient is φ = 11011112010210.
The previous prime is 11011112010203. The next prime is 11011112010277. The reversal of 11011112010211 is 11201021111011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11011112010211 - 23 = 11011112010203 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11011112010191 and 11011112010200.
It is not a weakly prime, because it can be changed into another prime (11011112014211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505556005105 + 5505556005106.
It is an arithmetic number, because the mean of its divisors is an integer number (5505556005106).
Almost surely, 211011112010211 is an apocalyptic number.
11011112010211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011112010211 is an equidigital number, since it uses as much as digits as its factorization.
11011112010211 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 11011112010211 its reverse (11201021111011), we get a palindrome (22212133121222).
It can be divided in two parts, 11011 and 112010211, that multiplied together give a palindrome (1233344433321).
The spelling of 11011112010211 in words is "eleven trillion, eleven billion, one hundred twelve million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •