Base | Representation |
---|---|
bin | 110011010100001111… |
… | …1110101101100111101 |
3 | 101112110002210222020121 |
4 | 1212220133311230331 |
5 | 3301142440213432 |
6 | 122343052014541 |
7 | 10650612622042 |
oct | 1465037655475 |
9 | 345402728217 |
10 | 110201101117 |
11 | 42810715388 |
12 | 19436161451 |
13 | a51307b453 |
14 | 5495bb11c9 |
15 | 2ceeabd197 |
hex | 19a87f5b3d |
110201101117 has 2 divisors, whose sum is σ = 110201101118. Its totient is φ = 110201101116.
The previous prime is 110201101081. The next prime is 110201101147. The reversal of 110201101117 is 711101102011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109520621721 + 680479396 = 330939^2 + 26086^2 .
It is a cyclic number.
It is not a de Polignac number, because 110201101117 - 211 = 110201099069 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110201101117.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110201101147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100550558 + 55100550559.
It is an arithmetic number, because the mean of its divisors is an integer number (55100550559).
Almost surely, 2110201101117 is an apocalyptic number.
It is an amenable number.
110201101117 is a deficient number, since it is larger than the sum of its proper divisors (1).
110201101117 is an equidigital number, since it uses as much as digits as its factorization.
110201101117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14, while the sum is 16.
Adding to 110201101117 its reverse (711101102011), we get a palindrome (821302203128).
The spelling of 110201101117 in words is "one hundred ten billion, two hundred one million, one hundred one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •