Search a number
-
+
56067111 = 3228322013
BaseRepresentation
bin1101010111100…
…0010000100111
310220111111121200
43111320100213
5103323121421
65321413543
71250363652
oct325702047
9126444550
1056067111
1129715061
121693a2b3
13b800b09
147636899
154dc7726
hex3578427

56067111 has 12 divisors (see below), whose sum is σ = 81275688. Its totient is φ = 37244304.

The previous prime is 56067107. The next prime is 56067133. The reversal of 56067111 is 11176065.

56067111 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 56067111 - 22 = 56067107 is a prime.

It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.

It is a congruent number.

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

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

Almost surely, 256067111 is an apocalyptic number.

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

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

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

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

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

The square root of 56067111 is about 7487.7974732227. The cubic root of 56067111 is about 382.7390073583.

The spelling of 56067111 in words is "fifty-six million, sixty-seven thousand, one hundred eleven".

Divisors: 1 3 9 283 849 2547 22013 66039 198117 6229679 18689037 56067111