Base | Representation |
---|---|
bin | 1010000110000111100000… |
… | …1100110010011010100011 |
3 | 1110022011120212102101011111 |
4 | 2201201320030302122203 |
5 | 2423331213300023021 |
6 | 35335211140524151 |
7 | 2223651414110302 |
oct | 241417014623243 |
9 | 43264525371144 |
10 | 11100212111011 |
11 | 359a63439a171 |
12 | 12b33666b0657 |
13 | 62698cb6b46a |
14 | 2a537884c439 |
15 | 143b1e3418e1 |
hex | a18783326a3 |
11100212111011 has 2 divisors, whose sum is σ = 11100212111012. Its totient is φ = 11100212111010.
The previous prime is 11100212110997. The next prime is 11100212111029. The reversal of 11100212111011 is 11011121200111.
It is a weak prime.
It is an emirp because it is prime and its reverse (11011121200111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11100212111011 - 235 = 11065852372643 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11100212110982 and 11100212111000.
It is not a weakly prime, because it can be changed into another prime (11100212111071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550106055505 + 5550106055506.
It is an arithmetic number, because the mean of its divisors is an integer number (5550106055506).
Almost surely, 211100212111011 is an apocalyptic number.
11100212111011 is a deficient number, since it is larger than the sum of its proper divisors (1).
11100212111011 is an equidigital number, since it uses as much as digits as its factorization.
11100212111011 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 11100212111011 its reverse (11011121200111), we get a palindrome (22111333311122).
The spelling of 11100212111011 in words is "eleven trillion, one hundred billion, two hundred twelve million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •