Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1110111111001111011 |
3 | 101112110002211102121202 |
4 | 1212220133313321323 |
5 | 3301142441011024 |
6 | 122343052124415 |
7 | 10650612660251 |
oct | 1465037677173 |
9 | 345402742552 |
10 | 110201110139 |
11 | 4281072113a |
12 | 1943616670b |
13 | a5130825a3 |
14 | 5495bb45d1 |
15 | 2ceeac0bae |
hex | 19a87f7e7b |
110201110139 has 2 divisors, whose sum is σ = 110201110140. Its totient is φ = 110201110138.
The previous prime is 110201110111. The next prime is 110201110141. The reversal of 110201110139 is 931011102011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110201110139 - 28 = 110201109883 is a prime.
Together with 110201110141, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110201110139.
It is not a weakly prime, because it can be changed into another prime (110201110739) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100555069 + 55100555070.
It is an arithmetic number, because the mean of its divisors is an integer number (55100555070).
Almost surely, 2110201110139 is an apocalyptic number.
110201110139 is a deficient number, since it is larger than the sum of its proper divisors (1).
110201110139 is an equidigital number, since it uses as much as digits as its factorization.
110201110139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 20.
The spelling of 110201110139 in words is "one hundred ten billion, two hundred one million, one hundred ten thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •