5000110110 has 96 divisors (see below), whose sum is σ = 14156532000. Its totient is φ = 1219615488.

The previous prime is 5000110097. The next prime is 5000110151. The reversal of 5000110110 is 110110005.

It is a super-2 number, since 2×5000110110² = 50002202224248424200, which contains 22 as substring.

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

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

It is a congruent number.

It is an unprimeable number.

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 47 ways as a sum of consecutive naturals, for example, 825 + ... + 100004.

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

Almost surely, 2^5000110110 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 5, while the sum is 9.

The square root of 5000110110 is about 70711.4567096450. The cubic root of 5000110110 is about 1709.9884989480.

Adding to 5000110110 its reverse (110110005), we get a palindrome (5110220115).

The spelling of 5000110110 in words is "five billion, one hundred ten thousand, one hundred ten".