111010110110969 has 2 divisors, whose sum is σ = 111010110110970. Its totient is φ = 111010110110968.

The previous prime is 111010110110947. The next prime is 111010110110981. The reversal of 111010110110969 is 969011011010111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 68276590591225 + 42733519519744 = 8262965^2 + 6537088^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (111010110110929) 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, 55505055055484 + 55505055055485.

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 32.

The spelling of 111010110110969 in words is "one hundred eleven trillion, ten billion, one hundred ten million, one hundred ten thousand, nine hundred sixty-nine".