Search a number
-
+
56401537 is a prime number
BaseRepresentation
bin1101011100100…
…1111010000001
310221010111100211
43113021322001
5103414322122
65332514121
71253255653
oct327117201
9127114324
1056401537
1129923345
1216a7b941
13b8ba0ba
1476c26d3
154e41877
hex35c9e81

56401537 has 2 divisors, whose sum is σ = 56401538. Its totient is φ = 56401536.

The previous prime is 56401511. The next prime is 56401559. The reversal of 56401537 is 73510465.

56401537 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., 55487601 + 913936 = 7449^2 + 956^2 .

It is a cyclic number.

It is not a de Polignac number, because 56401537 - 27 = 56401409 is a prime.

It is a super-2 number, since 2×564015372 = 6362266751924738, which contains 22 as substring.

It is a Chen prime.

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

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

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

Almost surely, 256401537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12600, while the sum is 31.

The square root of 56401537 is about 7510.0956718274. The cubic root of 56401537 is about 383.4984794828.

The spelling of 56401537 in words is "fifty-six million, four hundred one thousand, five hundred thirty-seven".