Search a number
-
+
56544063642553 is a prime number
BaseRepresentation
bin11001101101101001100001…
…10100111101101110111001
321102012120010000102111101211
430312310300310331232321
524402404220243030203
6320131552332243121
714624113415534104
oct1466646064755671
9242176100374354
1056544063642553
1117020225909853
1264127506104a1
13257210bb286c6
14dd6a6678773b
15680c92d59c6d
hex336d30d3dbb9

56544063642553 has 2 divisors, whose sum is σ = 56544063642554. Its totient is φ = 56544063642552.

The previous prime is 56544063642511. The next prime is 56544063642559. The reversal of 56544063642553 is 35524636044565.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 48755543655289 + 7788519987264 = 6982517^2 + 2790792^2 .

It is a cyclic number.

It is not a de Polignac number, because 56544063642553 - 213 = 56544063634361 is a prime.

It is a super-2 number, since 2×565440636425532 (a number of 28 digits) contains 22 as substring.

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

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

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

Almost surely, 256544063642553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 155520000, while the sum is 58.

The spelling of 56544063642553 in words is "fifty-six trillion, five hundred forty-four billion, sixty-three million, six hundred forty-two thousand, five hundred fifty-three".