Search a number
-
+
56565433 is a prime number
BaseRepresentation
bin1101011111000…
…1111010111001
310221102211012001
43113301322321
5103440043213
65340221001
71254540541
oct327617271
9127384161
1056565433
1129a254a1
1216b3a761
13b946892
147726321
154e751dd
hex35f1eb9

56565433 has 2 divisors, whose sum is σ = 56565434. Its totient is φ = 56565432.

The previous prime is 56565391. The next prime is 56565473. The reversal of 56565433 is 33456565.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 54641664 + 1923769 = 7392^2 + 1387^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 256565433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 162000, while the sum is 37.

The square root of 56565433 is about 7520.9994681558. Note that the first 3 decimals coincide. The cubic root of 56565433 is about 383.8695868812.

The spelling of 56565433 in words is "fifty-six million, five hundred sixty-five thousand, four hundred thirty-three".