110770608115031 has 2 divisors, whose sum is σ = 110770608115032. Its totient is φ = 110770608115030.

The previous prime is 110770608115001. The next prime is 110770608115039. The reversal of 110770608115031 is 130511806077011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 110770608115031 - 2³⁰ = 110769534373207 is a prime.

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

It is a Sophie Germain prime.

It is a self number, because there is not a number n which added to its sum of digits gives 110770608115031.

It is a congruent number.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 35280, while the sum is 41.

The spelling of 110770608115031 in words is "one hundred ten trillion, seven hundred seventy billion, six hundred eight million, one hundred fifteen thousand, thirty-one".