5110111000 has 64 divisors (see below), whose sum is σ = 11974304160. Its totient is φ = 2041200000.

The previous prime is 5110110983. The next prime is 5110111001. The reversal of 5110111000 is 1110115.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5110111001) 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, 807850 + ... + 814150.

Almost surely, 2^5110111000 is an apocalyptic number.

5110111000 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 5110111000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5987152080).

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

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

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

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

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

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

The square root of 5110111000 is about 71485.0403930780. The cubic root of 5110111000 is about 1722.4373907755.

Adding to 5110111000 its reverse (1110115), we get a palindrome (5111221115).

The spelling of 5110111000 in words is "five billion, one hundred ten million, one hundred eleven thousand".