13110112101529 has 2 divisors, whose sum is σ = 13110112101530. Its totient is φ = 13110112101528.

The previous prime is 13110112101461. The next prime is 13110112101557. The reversal of 13110112101529 is 92510121101131.

It is a happy number.

It is an a-pointer prime, because the next prime (13110112101557) can be obtained adding 13110112101529 to its sum of digits (28).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7229860545600 + 5880251555929 = 2688840^2 + 2424923^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 13110112101497 and 13110112101506.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 540, while the sum is 28.

The spelling of 13110112101529 in words is "thirteen trillion, one hundred ten billion, one hundred twelve million, one hundred one thousand, five hundred twenty-nine".