Search a number
-
+
56000900777051 is a prime number
BaseRepresentation
bin11001011101110101110011…
…10011000100010001011011
321100021122010001200000212002
430232322321303010101123
524320004321044331201
6315034243023111215
714536634345415416
oct1456727163042133
9240248101600762
1056000900777051
111693093760368a
12634542444250b
132532b2958c039
14db865acb6b7d
15671aa2c2976b
hex32eeb9cc445b

56000900777051 has 2 divisors, whose sum is σ = 56000900777052. Its totient is φ = 56000900777050.

The previous prime is 56000900777047. The next prime is 56000900777071. The reversal of 56000900777051 is 15077700900065.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 56000900777051 - 22 = 56000900777047 is a prime.

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

It is a Sophie Germain prime.

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

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

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

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

Almost surely, 256000900777051 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 463050, while the sum is 47.

The spelling of 56000900777051 in words is "fifty-six trillion, nine hundred million, seven hundred seventy-seven thousand, fifty-one".