10153311032 has 32 divisors (see below), whose sum is σ = 19333630800. Its totient is φ = 4998240000.

The previous prime is 10153311031. The next prime is 10153311043. The reversal of 10153311032 is 23011335101.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

Almost surely, 2^10153311032 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 270, while the sum is 20.

Adding to 10153311032 its reverse (23011335101), we get a palindrome (33164646133).

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