Base | Representation |
---|---|
bin | 11001000010010100000010… |
… | …000011011011000000000011 |
3 | 112102212102102221212002221101 |
4 | 121002110002003123000003 |
5 | 103413021001410102021 |
6 | 1030103515305035231 |
7 | 32123123124654565 |
oct | 3102240203330003 |
9 | 472772387762841 |
10 | 110110111019011 |
11 | 320a2488118554 |
12 | 104240b1485b17 |
13 | 495945379c48c |
14 | 1d29501b83335 |
15 | cae33b439a91 |
hex | 6425020db003 |
110110111019011 has 2 divisors, whose sum is σ = 110110111019012. Its totient is φ = 110110111019010.
The previous prime is 110110111018939. The next prime is 110110111019047. The reversal of 110110111019011 is 110910111011011.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110110111019011 - 223 = 110110102630403 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110110111019011.
It is not a weakly prime, because it can be changed into another prime (110110111079011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055055509505 + 55055055509506.
It is an arithmetic number, because the mean of its divisors is an integer number (55055055509506).
Almost surely, 2110110111019011 is an apocalyptic number.
110110111019011 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110111019011 is an equidigital number, since it uses as much as digits as its factorization.
110110111019011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 19.
The spelling of 110110111019011 in words is "one hundred ten trillion, one hundred ten billion, one hundred eleven million, nineteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •