10052150000 has 120 divisors (see below), whose sum is σ = 25404811488. Its totient is φ = 3845600000.

The previous prime is 10052149901. The next prime is 10052150039. The reversal of 10052150000 is 5125001.

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

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1145630 + ... + 1154370.

Almost surely, 2^10052150000 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 10052150000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12702405744).

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

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

10052150000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 50, while the sum is 14.

Adding to 10052150000 its reverse (5125001), we get a palindrome (10057275001).

The spelling of 10052150000 in words is "ten billion, fifty-two million, one hundred fifty thousand".