Search a number
-
+
56015137 is a prime number
BaseRepresentation
bin1101010110101…
…1100100100001
310220101212022201
43111223210201
5103314441022
65320333201
71250056303
oct325534441
9126355281
1056015137
112968a002
1216914201
13b7b3269
147621973
154db7127
hex356b921

56015137 has 2 divisors, whose sum is σ = 56015138. Its totient is φ = 56015136.

The previous prime is 56015107. The next prime is 56015159. The reversal of 56015137 is 73151065.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 54997056 + 1018081 = 7416^2 + 1009^2 .

It is a cyclic number.

It is not a de Polignac number, because 56015137 - 27 = 56015009 is a prime.

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (56015107) 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 as a sum of consecutive naturals, namely, 28007568 + 28007569.

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

Almost surely, 256015137 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 56015137 is about 7484.3260885667. The cubic root of 56015137 is about 382.6207049244.

The spelling of 56015137 in words is "fifty-six million, fifteen thousand, one hundred thirty-seven".