56110770 has 48 divisors (see below), whose sum is σ = 148374720. Its totient is φ = 14707872.

The previous prime is 56110757. The next prime is 56110771. The reversal of 56110770 is 7701165.

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

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (56110771) 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 23 ways as a sum of consecutive naturals, for example, 27 + ... + 10593.

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

Almost surely, 2^56110770 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1470, while the sum is 27.

The square root of 56110770 is about 7490.7122491790. The cubic root of 56110770 is about 382.8383268262.

The spelling of 56110770 in words is "fifty-six million, one hundred ten thousand, seven hundred seventy".