15011010013 has 8 divisors (see below), whose sum is σ = 15900287040. Its totient is φ = 14122430400.

The previous prime is 15011010011. The next prime is 15011010019. The reversal of 15011010013 is 31001011051.

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

It is not a de Polignac number, because 15011010013 - 2¹ = 15011010011 is a prime.

It is a super-2 number, since 2×15011010013² (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 = 15011009975 and 15011010002.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 129703 + ... + 216436.

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

Almost surely, 2^15011010013 is an apocalyptic number.

It is an amenable number.

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

15011010013 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 348707.

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

Adding to 15011010013 its reverse (31001011051), we get a palindrome (46012021064).

The spelling of 15011010013 in words is "fifteen billion, eleven million, ten thousand, thirteen".