110110283403161 has 2 divisors, whose sum is σ = 110110283403162. Its totient is φ = 110110283403160.

The previous prime is 110110283403119. The next prime is 110110283403181. The reversal of 110110283403161 is 161304382011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 62243326629136 + 47866956774025 = 7889444^2 + 6918595^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×110110283403161² (a number of 29 digits) contains 22 as substring.

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (110110283403181) 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, 55055141701580 + 55055141701581.

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

Almost surely, 2^{110110283403161} is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 110110283403161 in words is "one hundred ten trillion, one hundred ten billion, two hundred eighty-three million, four hundred three thousand, one hundred sixty-one".