5052107000 has 64 divisors (see below), whose sum is σ = 11840437440. Its totient is φ = 2017680000.

The previous prime is 5052106999. The next prime is 5052107009. The reversal of 5052107000 is 7012505.

It is a Harshad number since it is a multiple of its sum of digits (20).

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 697397 + ... + 704603.

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

Almost surely, 2^5052107000 is an apocalyptic number.

5052107000 is a gapful number since it is divisible by the number (50) 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 5052107000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5920218720).

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

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

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

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

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

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

The square root of 5052107000 is about 71078.1752720200. The cubic root of 5052107000 is about 1715.8955449954.

Adding to 5052107000 its reverse (7012505), we get a palindrome (5059119505).

The spelling of 5052107000 in words is "five billion, fifty-two million, one hundred seven thousand".