Search a number
-
+
56507551151 is a prime number
BaseRepresentation
bin110100101000000111…
…001100110110101111
312101212002221000120212
4310220013030312233
51411211413114101
641543104533035
74040211155042
oct645007146657
9171762830525
1056507551151
1121a680485a7
12ab5032117b
1354370358cc
142a40adcc59
15170ad381bb
hexd281ccdaf

56507551151 has 2 divisors, whose sum is σ = 56507551152. Its totient is φ = 56507551150.

The previous prime is 56507551049. The next prime is 56507551153. The reversal of 56507551151 is 15115570565.

It is a strong prime.

It is a cyclic number.

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

It is a Sophie Germain prime.

Together with 56507551153, it forms a pair of twin primes.

It is a Chen prime.

It is a junction number, because it is equal to n+sod(n) for n = 56507551099 and 56507551108.

It is a congruent number.

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

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

Almost surely, 256507551151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 131250, while the sum is 41.

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