10111109539 has 2 divisors, whose sum is σ = 10111109540. Its totient is φ = 10111109538.

The previous prime is 10111109501. The next prime is 10111109563. The reversal of 10111109539 is 93590111101.

10111109539 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-10111109539 is a prime.

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

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

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

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

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

Almost surely, 2^10111109539 is an apocalyptic number.

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

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

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

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

The spelling of 10111109539 in words is "ten billion, one hundred eleven million, one hundred nine thousand, five hundred thirty-nine".