10100011110127 has 2 divisors, whose sum is σ = 10100011110128. Its totient is φ = 10100011110126.

The previous prime is 10100011110089. The next prime is 10100011110143. The reversal of 10100011110127 is 72101111000101.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10100011110127 - 2⁷ = 10100011109999 is a prime.

It is a super-2 number, since 2×10100011110127² (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 10100011110127.

It is a congruent number.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 14, while the sum is 16.

Adding to 10100011110127 its reverse (72101111000101), we get a palindrome (82201122110228).

The spelling of 10100011110127 in words is "ten trillion, one hundred billion, eleven million, one hundred ten thousand, one hundred twenty-seven".