Search a number
-
+
56567067057433 is a prime number
BaseRepresentation
bin11001101110010100010111…
…11100000001110100011001
321102021202111011102001022201
430313022023330001310121
524403243323131314213
6320150315111250201
714625556440405442
oct1467121374016431
9242252434361281
1056567067057433
1117029a5a720929
1264170b0379961
132574336811cba
14dd7c098c42c9
1568168c5e16dd
hex33728bf01d19

56567067057433 has 2 divisors, whose sum is σ = 56567067057434. Its totient is φ = 56567067057432.

The previous prime is 56567067057401. The next prime is 56567067057451. The reversal of 56567067057433 is 33475076076565.

56567067057433 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., 54098422756569 + 2468644300864 = 7355163^2 + 1571192^2 .

It is a cyclic number.

It is not a de Polignac number, because 56567067057433 - 25 = 56567067057401 is a prime.

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

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

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

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

Almost surely, 256567067057433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 333396000, while the sum is 64.

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