Base | Representation |
---|---|
bin | 101101101110100010010011… |
… | …000100001010101100000011 |
3 | 222101001221002210120220101221 |
4 | 231232202103010022230003 |
5 | 202324441303044323021 |
6 | 1551420355500535511 |
7 | 60234501450610402 |
oct | 5556422304125403 |
9 | 871057083526357 |
10 | 201110016011011 |
11 | 59097308124698 |
12 | 1a680575551597 |
13 | 882a79316c193 |
14 | 3793ac341b639 |
15 | 183b4ee012241 |
hex | b6e89310ab03 |
201110016011011 has 2 divisors, whose sum is σ = 201110016011012. Its totient is φ = 201110016011010.
The previous prime is 201110016010963. The next prime is 201110016011027. The reversal of 201110016011011 is 110110610011102.
It is an a-pointer prime, because the next prime (201110016011027) can be obtained adding 201110016011011 to its sum of digits (16).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 201110016011011 - 221 = 201110013913859 is a prime.
It is not a weakly prime, because it can be changed into another prime (201110016011041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555008005505 + 100555008005506.
It is an arithmetic number, because the mean of its divisors is an integer number (100555008005506).
Almost surely, 2201110016011011 is an apocalyptic number.
201110016011011 is a deficient number, since it is larger than the sum of its proper divisors (1).
201110016011011 is an equidigital number, since it uses as much as digits as its factorization.
201110016011011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 201110016011011 its reverse (110110610011102), we get a palindrome (311220626022113).
The spelling of 201110016011011 in words is "two hundred one trillion, one hundred ten billion, sixteen million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •