111111101111701 has 2 divisors, whose sum is σ = 111111101111702. Its totient is φ = 111111101111700.

The previous prime is 111111101111629. The next prime is 111111101111761. The reversal of 111111101111701 is 107111101111111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 85890355967025 + 25220745144676 = 9267705^2 + 5022026^2 .

It is a cyclic number.

It is not a de Polignac number, because 111111101111701 - 2⁹ = 111111101111189 is a prime.

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

It is a congruent number.

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7, while the sum is 19.

Adding to 111111101111701 its reverse (107111101111111), we get a palindrome (218222202222812).

The spelling of 111111101111701 in words is "one hundred eleven trillion, one hundred eleven billion, one hundred one million, one hundred eleven thousand, seven hundred one".