Base | Representation |
---|---|
bin | 110011010001010001… |
… | …0010111011000111101 |
3 | 101112012010122101121222 |
4 | 1212202202113120331 |
5 | 3300441340200333 |
6 | 122325120403125 |
7 | 10645256623625 |
oct | 1464242273075 |
9 | 345163571558 |
10 | 110101100093 |
11 | 4276a223106 |
12 | 194087764a5 |
13 | a4c843734a |
14 | 54867bd885 |
15 | 2ce5e18298 |
hex | 19a289763d |
110101100093 has 2 divisors, whose sum is σ = 110101100094. Its totient is φ = 110101100092.
The previous prime is 110101100089. The next prime is 110101100107. The reversal of 110101100093 is 390001101011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 101749516324 + 8351583769 = 318982^2 + 91387^2 .
It is an emirp because it is prime and its reverse (390001101011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110101100093 - 22 = 110101100089 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110101100033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050550046 + 55050550047.
It is an arithmetic number, because the mean of its divisors is an integer number (55050550047).
Almost surely, 2110101100093 is an apocalyptic number.
It is an amenable number.
110101100093 is a deficient number, since it is larger than the sum of its proper divisors (1).
110101100093 is an equidigital number, since it uses as much as digits as its factorization.
110101100093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 17.
The spelling of 110101100093 in words is "one hundred ten billion, one hundred one million, one hundred thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •