110221103120123 has 2 divisors, whose sum is σ = 110221103120124. Its totient is φ = 110221103120122.

The previous prime is 110221103120119. The next prime is 110221103120143. The reversal of 110221103120123 is 321021301122011.

It is an a-pointer prime, because the next prime (110221103120143) can be obtained adding 110221103120123 to its sum of digits (20).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 110221103120123 - 2² = 110221103120119 is a prime.

It is a Sophie Germain prime.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 144, while the sum is 20.

Adding to 110221103120123 its reverse (321021301122011), we get a palindrome (431242404242134).

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