15110113 has 4 divisors (see below), whose sum is σ = 15597568. Its totient is φ = 14622660.

The previous prime is 15110101. The next prime is 15110129. The reversal of 15110113 is 31101151.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (15110143) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 243681 + ... + 243742.

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

Almost surely, 2^15110113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 487454.

The product of its (nonzero) digits is 15, while the sum is 13.

The square root of 15110113 is about 3887.1728801277. The cubic root of 15110113 is about 247.2232078926.

Adding to 15110113 its reverse (31101151), we get a palindrome (46211264).

The spelling of 15110113 in words is "fifteen million, one hundred ten thousand, one hundred thirteen".