110109975793361 has 2 divisors, whose sum is σ = 110109975793362. Its totient is φ = 110109975793360.

The previous prime is 110109975793357. The next prime is 110109975793373. The reversal of 110109975793361 is 163397579901011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 71909467203025 + 38200508590336 = 8479945^2 + 6180656^2 .

It is a cyclic number.

It is not a de Polignac number, because 110109975793361 - 2² = 110109975793357 is a prime.

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9644670, while the sum is 62.

The spelling of 110109975793361 in words is "one hundred ten trillion, one hundred nine billion, nine hundred seventy-five million, seven hundred ninety-three thousand, three hundred sixty-one".