101000011111117 has 2 divisors, whose sum is σ = 101000011111118. Its totient is φ = 101000011111116.

The previous prime is 101000011111079. The next prime is 101000011111133. The reversal of 101000011111117 is 711111110000101.

It is an a-pointer prime, because the next prime (101000011111133) can be obtained adding 101000011111117 to its sum of digits (16).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100135025549001 + 864985562116 = 10006749^2 + 930046^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 101000011111117 - 2⁷ = 101000011110989 is a prime.

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

It is a congruent number.

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

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

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

It is an amenable number.

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

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

101000011111117 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 16.

Adding to 101000011111117 its reverse (711111110000101), we get a palindrome (812111121111218).

The spelling of 101000011111117 in words is "one hundred one trillion, eleven million, one hundred eleven thousand, one hundred seventeen".