Base | Representation |
---|---|
bin | 11001000011110010000110… |
… | …000100101110001011011011 |
3 | 112110020002010202122002212101 |
4 | 121003302012010232023123 |
5 | 103421144323202400102 |
6 | 1030222141324024231 |
7 | 32133330023563354 |
oct | 3103620604561333 |
9 | 473202122562771 |
10 | 110211110200027 |
11 | 321312a6568091 |
12 | 1043b799992077 |
13 | 4965b2b2c0395 |
14 | 1d303637bad2b |
15 | cb1c9d242e87 |
hex | 643c8612e2db |
110211110200027 has 2 divisors, whose sum is σ = 110211110200028. Its totient is φ = 110211110200026.
The previous prime is 110211110199997. The next prime is 110211110200031. The reversal of 110211110200027 is 720002011112011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110211110200027 - 219 = 110211109675739 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110211110199977 and 110211110200013.
It is not a weakly prime, because it can be changed into another prime (110211110000027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105555100013 + 55105555100014.
It is an arithmetic number, because the mean of its divisors is an integer number (55105555100014).
Almost surely, 2110211110200027 is an apocalyptic number.
110211110200027 is a deficient number, since it is larger than the sum of its proper divisors (1).
110211110200027 is an equidigital number, since it uses as much as digits as its factorization.
110211110200027 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 110211110200027 its reverse (720002011112011), we get a palindrome (830213121312038).
The spelling of 110211110200027 in words is "one hundred ten trillion, two hundred eleven billion, one hundred ten million, two hundred thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •