Search a number
-
+
56566115065961 is a prime number
BaseRepresentation
bin11001101110010010100110…
…01100011110000001101001
321102021200000211001212112022
430313021103030132001221
524403234400424102321
6320150040422554225
714625524030536214
oct1467112314360151
9242250024055468
1056566115065961
1117029611308616
126416a85598975
132574214513937
14dd7b592b277b
15681633c44dab
hex33725331e069

56566115065961 has 2 divisors, whose sum is σ = 56566115065962. Its totient is φ = 56566115065960.

The previous prime is 56566115065921. The next prime is 56566115066023. The reversal of 56566115065961 is 16956051166565.

It is an a-pointer prime, because the next prime (56566115066023) can be obtained adding 56566115065961 to its sum of digits (62).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 37974323353561 + 18591791712400 = 6162331^2 + 4311820^2 .

It is a cyclic number.

It is not a de Polignac number, because 56566115065961 - 234 = 56548935196777 is a prime.

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

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

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

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

Almost surely, 256566115065961 is an apocalyptic number.

It is an amenable number.

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

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

56566115065961 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 43740000, while the sum is 62.

The spelling of 56566115065961 in words is "fifty-six trillion, five hundred sixty-six billion, one hundred fifteen million, sixty-five thousand, nine hundred sixty-one".