15113681051 has 8 divisors (see below), whose sum is σ = 17290648320. Its totient is φ = 12941181288.

The previous prime is 15113681027. The next prime is 15113681057. The reversal of 15113681051 is 15018631151.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 15113681051 - 2¹⁸ = 15113418907 is a prime.

It is a super-2 number, since 2×15113681051² (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (15113681057) 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 in 7 ways as a sum of consecutive naturals, for example, 1109621 + ... + 1123158.

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

Almost surely, 2^15113681051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2233753.

The product of its (nonzero) digits is 3600, while the sum is 32.

The spelling of 15113681051 in words is "fifteen billion, one hundred thirteen million, six hundred eighty-one thousand, fifty-one".