10111106915797 has 2 divisors, whose sum is σ = 10111106915798. Its totient is φ = 10111106915796.

The previous prime is 10111106915779. The next prime is 10111106915801. The reversal of 10111106915797 is 79751960111101.

Together with previous prime (10111106915779) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5536260761476 + 4574846154321 = 2352926^2 + 2138889^2 .

It is a cyclic number.

It is not a de Polignac number, because 10111106915797 - 2²⁷ = 10110972698069 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 119070, while the sum is 49.

The spelling of 10111106915797 in words is "ten trillion, one hundred eleven billion, one hundred six million, nine hundred fifteen thousand, seven hundred ninety-seven".