Search a number
-
+
110110506111077 is a prime number
BaseRepresentation
bin11001000010010100011001…
…100110100101000001100101
3112102212110110111021212100212
4121002110121212211001211
5103413022304031023302
61030104022421145205
732123135663125523
oct3102243146450145
9472773414255325
10110110506111077
11320a267014101a
12104241a185b205
1349594b75b2b74
141d2953c42b313
15cae360e7e052
hex6425199a5065

110110506111077 has 2 divisors, whose sum is σ = 110110506111078. Its totient is φ = 110110506111076.

The previous prime is 110110506111059. The next prime is 110110506111113. The reversal of 110110506111077 is 770111605011011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 92745875377156 + 17364630733921 = 9630466^2 + 4167089^2 .

It is a cyclic number.

It is not a de Polignac number, because 110110506111077 - 26 = 110110506111013 is a prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2110110506111077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1470, while the sum is 32.

The spelling of 110110506111077 in words is "one hundred ten trillion, one hundred ten billion, five hundred six million, one hundred eleven thousand, seventy-seven".