Base | Representation |
---|---|
bin | 110011010001010000… |
… | …1111111001110011001 |
3 | 101112012010110100212001 |
4 | 1212202201333032121 |
5 | 3300441324013423 |
6 | 122325114321001 |
7 | 10645256032225 |
oct | 1464241771631 |
9 | 345163410761 |
10 | 110101001113 |
11 | 4276a165804 |
12 | 19408729161 |
13 | a4c840128c |
14 | 5486795785 |
15 | 2ce5de8cad |
hex | 19a287f399 |
110101001113 has 2 divisors, whose sum is σ = 110101001114. Its totient is φ = 110101001112.
The previous prime is 110101001083. The next prime is 110101001119. The reversal of 110101001113 is 311100101011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105746584969 + 4354416144 = 325187^2 + 65988^2 .
It is a cyclic number.
It is not a de Polignac number, because 110101001113 - 229 = 109564130201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110101001113.
It is not a weakly prime, because it can be changed into another prime (110101001119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55050500556 + 55050500557.
It is an arithmetic number, because the mean of its divisors is an integer number (55050500557).
Almost surely, 2110101001113 is an apocalyptic number.
It is an amenable number.
110101001113 is a deficient number, since it is larger than the sum of its proper divisors (1).
110101001113 is an equidigital number, since it uses as much as digits as its factorization.
110101001113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 110101001113 its reverse (311100101011), we get a palindrome (421201102124).
The spelling of 110101001113 in words is "one hundred ten billion, one hundred one million, one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •