Search a number
-
+
110110221201089 is a prime number
BaseRepresentation
bin11001000010010100001000…
…100111101110111011000001
3112102212102201122011221100002
4121002110020213232323001
5103413021213111413324
61030103534242405345
732123125633335254
oct3102241047567301
9472772648157302
10110110221201089
11320a2534333a1a
1210424122360855
134959470569685
141d2951266509b
15cae345e513ae
hex6425089eeec1

110110221201089 has 2 divisors, whose sum is σ = 110110221201090. Its totient is φ = 110110221201088.

The previous prime is 110110221200981. The next prime is 110110221201263. The reversal of 110110221201089 is 980102122011011.

Together with previous prime (110110221200981) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 83719572025600 + 26390649175489 = 9149840^2 + 5137183^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-110110221201089 is a prime.

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

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

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

Almost surely, 2110110221201089 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 576, while the sum is 29.

The spelling of 110110221201089 in words is "one hundred ten trillion, one hundred ten billion, two hundred twenty-one million, two hundred one thousand, eighty-nine".