15110100109913 has 2 divisors, whose sum is σ = 15110100109914. Its totient is φ = 15110100109912.

The previous prime is 15110100109873. The next prime is 15110100109931. The reversal of 15110100109913 is 31990100101151.

Together with next prime (15110100109931) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12456579654544 + 2653520455369 = 3529388^2 + 1628963^2 .

It is a cyclic number.

It is not a de Polignac number, because 15110100109913 - 2¹⁰ = 15110100108889 is a prime.

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

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

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

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

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

It is an amenable number.

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

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

15110100109913 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 32.

The spelling of 15110100109913 in words is "fifteen trillion, one hundred ten billion, one hundred million, one hundred nine thousand, nine hundred thirteen".