Search a number
-
+
56500611157 is a prime number
BaseRepresentation
bin110100100111101100…
…101110100001010101
312101211121212102201001
4310213230232201111
51411203124024112
641542300103301
74040065161604
oct644754564125
9171747772631
1056500611157
1121a64138471
12ab49b34b31
135435775ac3
142a3dc13a3b
15170a416c57
hexd27b2e855

56500611157 has 2 divisors, whose sum is σ = 56500611158. Its totient is φ = 56500611156.

The previous prime is 56500611149. The next prime is 56500611187. The reversal of 56500611157 is 75111600565.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 49465763281 + 7034847876 = 222409^2 + 83874^2 .

It is a cyclic number.

It is not a de Polignac number, because 56500611157 - 23 = 56500611149 is a prime.

It is a super-3 number, since 3×565006111573 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (56500611187) 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, 28250305578 + 28250305579.

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

Almost surely, 256500611157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 31500, while the sum is 37.

The spelling of 56500611157 in words is "fifty-six billion, five hundred million, six hundred eleven thousand, one hundred fifty-seven".