Search a number
-
+
56265271045561 is a prime number
BaseRepresentation
bin11001100101100010001110…
…11111100110110110111001
321101012220111110222011110101
430302301013133212312321
524333322233341424221
6315355524135315401
714565013603545634
oct1462610737466671
9241186443864411
1056265271045561
1116a22a707442a6
12638870551bb61
132551a3b88b696
14dc737a026c1b
156788c7415d91
hex332c477e6db9

56265271045561 has 2 divisors, whose sum is σ = 56265271045562. Its totient is φ = 56265271045560.

The previous prime is 56265271045549. The next prime is 56265271045579. The reversal of 56265271045561 is 16554017256265.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 56060320174336 + 204950871225 = 7487344^2 + 452715^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 256265271045561 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 15120000, while the sum is 55.

The spelling of 56265271045561 in words is "fifty-six trillion, two hundred sixty-five billion, two hundred seventy-one million, forty-five thousand, five hundred sixty-one".