10111001101969 has 2 divisors, whose sum is σ = 10111001101970. Its totient is φ = 10111001101968.

The previous prime is 10111001101963. The next prime is 10111001102009. The reversal of 10111001101969 is 96910110011101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 6059991507025 + 4051009594944 = 2461705^2 + 2012712^2 .

It is an emirp because it is prime and its reverse (96910110011101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10111001101969 - 2⁵ = 10111001101937 is a prime.

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

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

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

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

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

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

It is an amenable number.

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

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

10111001101969 is an evil number, because the sum of its binary digits is even.

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

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