10151511013 has 4 divisors (see below), whose sum is σ = 11601726880. Its totient is φ = 8701295148.

The previous prime is 10151511011. The next prime is 10151511023. The reversal of 10151511013 is 31011515101.

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, and also an emirpimes, since its reverse is a distinct semiprime: 31011515101 = 7 ⋅4430216443.

It is not a de Polignac number, because 10151511013 - 2¹ = 10151511011 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10151511011) 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, 725107923 + ... + 725107936.

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

Almost surely, 2^10151511013 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1450215866.

The product of its (nonzero) digits is 75, while the sum is 19.

The spelling of 10151511013 in words is "ten billion, one hundred fifty-one million, five hundred eleven thousand, thirteen".