Base | Representation |
---|---|
bin | 11001000010010100000001… |
… | …011101101000000011010001 |
3 | 112102212102102021012201200202 |
4 | 121002110001131220003101 |
5 | 103413020441341022433 |
6 | 1030103514312424545 |
7 | 32123122644520334 |
oct | 3102240135500321 |
9 | 472772367181622 |
10 | 110110101110993 |
11 | 320a2482570505 |
12 | 104240aa0a8155 |
13 | 4959451710749 |
14 | 1d2950072461b |
15 | cae33a62dee8 |
hex | 6425017680d1 |
110110101110993 has 2 divisors, whose sum is σ = 110110101110994. Its totient is φ = 110110101110992.
The previous prime is 110110101110983. The next prime is 110110101111053. The reversal of 110110101110993 is 399011101011011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108544579651729 + 1565521459264 = 10418473^2 + 1251208^2 .
It is an emirp because it is prime and its reverse (399011101011011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110110101110993 - 222 = 110110096916689 is a prime.
It is not a weakly prime, because it can be changed into another prime (110110101110923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055050555496 + 55055050555497.
It is an arithmetic number, because the mean of its divisors is an integer number (55055050555497).
Almost surely, 2110110101110993 is an apocalyptic number.
It is an amenable number.
110110101110993 is a deficient number, since it is larger than the sum of its proper divisors (1).
110110101110993 is an equidigital number, since it uses as much as digits as its factorization.
110110101110993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 243, while the sum is 29.
The spelling of 110110101110993 in words is "one hundred ten trillion, one hundred ten billion, one hundred one million, one hundred ten thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •