Search a number
-
+
56511050 = 25210910369
BaseRepresentation
bin1101011110010…
…0101001001010
310221100001120212
43113210221022
5103431323200
65335121122
71254223151
oct327445112
9127301525
1056511050
1129998652
1216b131a2
13b927bbb
147710598
154e64035
hex35e4a4a

56511050 has 24 divisors (see below), whose sum is σ = 106085100. Its totient is φ = 22394880.

The previous prime is 56511029. The next prime is 56511089. The reversal of 56511050 is 5011565.

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

It can be written as a sum of positive squares in 6 ways, for example, as 11607649 + 44903401 = 3407^2 + 6701^2 .

It is a Curzon 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 11 ways as a sum of consecutive naturals, for example, 266 + ... + 10634.

Almost surely, 256511050 is an apocalyptic number.

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

56511050 is a deficient number, since it is larger than the sum of its proper divisors (49574050).

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

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

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

The product of its (nonzero) digits is 750, while the sum is 23.

The square root of 56511050 is about 7517.3831883176. The cubic root of 56511050 is about 383.7465277832.

The spelling of 56511050 in words is "fifty-six million, five hundred eleven thousand, fifty".

Divisors: 1 2 5 10 25 50 109 218 545 1090 2725 5450 10369 20738 51845 103690 259225 518450 1130221 2260442 5651105 11302210 28255525 56511050