Search a number
-
+
56096111 is a prime number
BaseRepresentation
bin1101010111111…
…1010101101111
310220112222101202
43111333111233
5103330033421
65322200115
71250544341
oct325772557
9126488352
1056096111
1129734925
121695303b
13b811086
147643291
154dd110b
hex357f56f

56096111 has 2 divisors, whose sum is σ = 56096112. Its totient is φ = 56096110.

The previous prime is 56096099. The next prime is 56096119. The reversal of 56096111 is 11169065.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-56096111 is a prime.

It is a Chen prime.

It is equal to p3343727 and since 56096111 and 3343727 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (56096119) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28048055 + 28048056.

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

Almost surely, 256096111 is an apocalyptic number.

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

56096111 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 1620, while the sum is 29.

The square root of 56096111 is about 7489.7337068817. The cubic root of 56096111 is about 382.8049849453.

The spelling of 56096111 in words is "fifty-six million, ninety-six thousand, one hundred eleven".