Search a number
-
+
5051000560057 is a prime number
BaseRepresentation
bin100100110000000011100…
…0110000001100110111001
3122212212111220200000101221
41021200013012001212321
51130223422120410212
614424221515312041
71030631334240454
oct111400706014671
918785456600357
105051000560057
111678132156151
12696b01a4b621
132a83cc20905a
14136680d2c49b
158b5c4d58807
hex498071819b9

5051000560057 has 2 divisors, whose sum is σ = 5051000560058. Its totient is φ = 5051000560056.

The previous prime is 5051000560033. The next prime is 5051000560061. The reversal of 5051000560057 is 7500650001505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4113335634496 + 937664925561 = 2028136^2 + 968331^2 .

It is a cyclic number.

It is not a de Polignac number, because 5051000560057 - 231 = 5048853076409 is a prime.

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

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

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

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

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

Almost surely, 25051000560057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 26250, while the sum is 34.

The spelling of 5051000560057 in words is "five trillion, fifty-one billion, five hundred sixty thousand, fifty-seven".