10152311013 has 40 divisors (see below), whose sum is σ = 16371906936. Its totient is φ = 6232464000.

The previous prime is 10152311011. The next prime is 10152311023. The reversal of 10152311013 is 31011325101.

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

It can be written as a sum of positive squares in 4 ways, for example, as 276324129 + 9875986884 = 16623^2 + 99378^2 .

It is not a de Polignac number, because 10152311013 - 2¹ = 10152311011 is a prime.

It is a congruent number.

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

It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 431863 + ... + 454763.

Almost surely, 2^10152311013 is an apocalyptic number.

10152311013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 23347 (or 23338 counting only the distinct ones).

The product of its (nonzero) digits is 90, while the sum is 18.

Adding to 10152311013 its reverse (31011325101), we get a palindrome (41163636114).

The spelling of 10152311013 in words is "ten billion, one hundred fifty-two million, three hundred eleven thousand, thirteen".