Base | Representation |
---|---|
bin | 110011010011000111… |
… | …0111011100011010101 |
3 | 101112100110100000222122 |
4 | 1212212032323203111 |
5 | 3301103224123242 |
6 | 122335213505325 |
7 | 10646642010023 |
oct | 1464616734325 |
9 | 345313300878 |
10 | 110163114197 |
11 | 427a122a234 |
12 | 194254a2245 |
13 | a50823ac96 |
14 | 5490b23713 |
15 | 2ceb5b7ad2 |
hex | 19a63bb8d5 |
110163114197 has 2 divisors, whose sum is σ = 110163114198. Its totient is φ = 110163114196.
The previous prime is 110163114161. The next prime is 110163114199. The reversal of 110163114197 is 791411361011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 86851626436 + 23311487761 = 294706^2 + 152681^2 .
It is an emirp because it is prime and its reverse (791411361011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110163114197 is a prime.
Together with 110163114199, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110163114199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55081557098 + 55081557099.
It is an arithmetic number, because the mean of its divisors is an integer number (55081557099).
Almost surely, 2110163114197 is an apocalyptic number.
It is an amenable number.
110163114197 is a deficient number, since it is larger than the sum of its proper divisors (1).
110163114197 is an equidigital number, since it uses as much as digits as its factorization.
110163114197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 35.
It can be divided in two parts, 11016 and 3114197, that added together give a palindrome (3125213).
The spelling of 110163114197 in words is "one hundred ten billion, one hundred sixty-three million, one hundred fourteen thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •