Search a number
-
+
110222010121117 is a prime number
BaseRepresentation
bin11001000011111100001111…
…110000100111101110011101
3112110021010021101202110122111
4121003330033300213232131
5103421334134042333432
61030231143055114021
732134164106435066
oct3103741760475635
9473233241673574
10110222010121117
113213598a260134
1210441920212911
134966b7757732b
141d30ab927956d
15cb21da114347
hex643f0fc27b9d

110222010121117 has 2 divisors, whose sum is σ = 110222010121118. Its totient is φ = 110222010121116.

The previous prime is 110222010121033. The next prime is 110222010121163. The reversal of 110222010121117 is 711121010222011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 109266756049476 + 955254071641 = 10453074^2 + 977371^2 .

It is an emirp because it is prime and its reverse (711121010222011) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 110222010121117 - 211 = 110222010119069 is a prime.

It is a congruent number.

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

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

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

Almost surely, 2110222010121117 is an apocalyptic number.

It is an amenable number.

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

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

110222010121117 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 112, while the sum is 22.

Adding to 110222010121117 its reverse (711121010222011), we get a palindrome (821343020343128).

The spelling of 110222010121117 in words is "one hundred ten trillion, two hundred twenty-two billion, ten million, one hundred twenty-one thousand, one hundred seventeen".