10111110109489 has 2 divisors, whose sum is σ = 10111110109490. Its totient is φ = 10111110109488.

The previous prime is 10111110109469. The next prime is 10111110109493. The reversal of 10111110109489 is 98490101111101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7903829390625 + 2207280718864 = 2811375^2 + 1485692^2 .

It is a cyclic number.

It is not a de Polignac number, because 10111110109489 - 2¹⁵ = 10111110076721 is a prime.

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

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 37.

The spelling of 10111110109489 in words is "ten trillion, one hundred eleven billion, one hundred ten million, one hundred nine thousand, four hundred eighty-nine".