110311215997 has 2 divisors, whose sum is σ = 110311215998. Its totient is φ = 110311215996.

The previous prime is 110311215979. The next prime is 110311216033. The reversal of 110311215997 is 799512113011.

Together with previous prime (110311215979) 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., 103053198361 + 7258017636 = 321019^2 + 85194^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 2^110311215997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17010, while the sum is 40.

The spelling of 110311215997 in words is "one hundred ten billion, three hundred eleven million, two hundred fifteen thousand, nine hundred ninety-seven".