10135642152 has 32 divisors (see below), whose sum is σ = 25341573600. Its totient is φ = 3378218304.

The previous prime is 10135642151. The next prime is 10135642157. The reversal of 10135642152 is 25124653101.

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

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

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

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

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

Almost surely, 2^10135642152 is an apocalyptic number.

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

It is an amenable number.

10135642152 is an abundant number, since it is smaller than the sum of its proper divisors (15205931448).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 7200, while the sum is 30.

The spelling of 10135642152 in words is "ten billion, one hundred thirty-five million, six hundred forty-two thousand, one hundred fifty-two".