Base | Representation |
---|---|
bin | 101101101110100010010011… |
… | …000100001010101100100001 |
3 | 222101001221002210120220110001 |
4 | 231232202103010022230201 |
5 | 202324441303044323131 |
6 | 1551420355500540001 |
7 | 60234501450610444 |
oct | 5556422304125441 |
9 | 871057083526401 |
10 | 201110016011041 |
11 | 59097308124715 |
12 | 1a680575551601 |
13 | 882a79316c1b7 |
14 | 3793ac341b65b |
15 | 183b4ee012261 |
hex | b6e89310ab21 |
201110016011041 has 2 divisors, whose sum is σ = 201110016011042. Its totient is φ = 201110016011040.
The previous prime is 201110016011027. The next prime is 201110016011071. The reversal of 201110016011041 is 140110610011102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 107320069011600 + 93789946999441 = 10359540^2 + 9684521^2 .
It is a cyclic number.
It is not a de Polignac number, because 201110016011041 - 27 = 201110016010913 is a prime.
It is a super-2 number, since 2×2011100160110412 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (201110016011011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100555008005520 + 100555008005521.
It is an arithmetic number, because the mean of its divisors is an integer number (100555008005521).
Almost surely, 2201110016011041 is an apocalyptic number.
It is an amenable number.
201110016011041 is a deficient number, since it is larger than the sum of its proper divisors (1).
201110016011041 is an equidigital number, since it uses as much as digits as its factorization.
201110016011041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 201110016011041 its reverse (140110610011102), we get a palindrome (341220626022143).
The spelling of 201110016011041 in words is "two hundred one trillion, one hundred ten billion, sixteen million, eleven thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •