Search a number
-
+
56050371 = 3213243857
BaseRepresentation
bin1101010111010…
…0001011000011
310220110122122200
43111310023003
5103322102441
65321204243
71250264106
oct325641303
9126418580
1056050371
1129703523
1216930683
13b7c6300
14763073d
154dc27b6
hex35742c3

56050371 has 36 divisors (see below), whose sum is σ = 89812008. Its totient is φ = 33651072.

The previous prime is 56050369. The next prime is 56050439. The reversal of 56050371 is 17305065.

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

It is not a de Polignac number, because 56050371 - 21 = 56050369 is a prime.

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

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

Almost surely, 256050371 is an apocalyptic number.

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

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

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

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

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

The square root of 56050371 is about 7486.6795710782. The cubic root of 56050371 is about 382.7009120078.

The spelling of 56050371 in words is "fifty-six million, fifty thousand, three hundred seventy-one".

Divisors: 1 3 9 13 39 43 117 129 169 387 507 559 857 1521 1677 2571 5031 7267 7713 11141 21801 33423 36851 65403 100269 110553 144833 331659 434499 479063 1303497 1437189 4311567 6227819 18683457 56050371