10000011111709 has 2 divisors, whose sum is σ = 10000011111710. Its totient is φ = 10000011111708.

The previous prime is 10000011111677. The next prime is 10000011111731. The reversal of 10000011111709 is 90711111000001.

It is an a-pointer prime, because the next prime (10000011111731) can be obtained adding 10000011111709 to its sum of digits (22).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5485010840100 + 4515000271609 = 2342010^2 + 2124853^2 .

It is a cyclic number.

It is not a de Polignac number, because 10000011111709 - 2⁵ = 10000011111677 is a prime.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 63, while the sum is 22.

The spelling of 10000011111709 in words is "ten trillion, eleven million, one hundred eleven thousand, seven hundred nine".