Search a number
-
+
110111011100117 is a prime number
BaseRepresentation
bin11001000010010100110111…
…101100111101010111010101
3112102212111202200111222002122
4121002110313230331113111
5103413024322320200432
61030104144500545325
732123154334352006
oct3102246754752725
9472774680458078
10110111011100117
11320a28aa1a5835
12104243029b2245
1349595680c3a51
141d295895211ad
15cae390480612
hex642537b3d5d5

110111011100117 has 2 divisors, whose sum is σ = 110111011100118. Its totient is φ = 110111011100116.

The previous prime is 110111011100107. The next prime is 110111011100131. The reversal of 110111011100117 is 711001110111011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 87246920447236 + 22864090652881 = 9340606^2 + 4781641^2 .

It is a cyclic number.

It is not a de Polignac number, because 110111011100117 - 218 = 110111010837973 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 110111011100095 and 110111011100104.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (110111011100107) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55055505550058 + 55055505550059.

It is an arithmetic number, because the mean of its divisors is an integer number (55055505550059).

Almost surely, 2110111011100117 is an apocalyptic number.

It is an amenable number.

110111011100117 is a deficient number, since it is larger than the sum of its proper divisors (1).

110111011100117 is an equidigital number, since it uses as much as digits as its factorization.

110111011100117 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 7, while the sum is 17.

Adding to 110111011100117 its reverse (711001110111011), we get a palindrome (821112121211128).

The spelling of 110111011100117 in words is "one hundred ten trillion, one hundred eleven billion, eleven million, one hundred thousand, one hundred seventeen".