Search a number
-
+
56017050937 is a prime number
BaseRepresentation
bin110100001010111000…
…000101110100111001
312100120220222000210021
4310022320011310321
51404210331112222
641422303450441
74022104035211
oct641270056471
9170526860707
1056017050937
112183618a521
12aa33bb6a21
1353895287b3
1429d58db241
1516ccc49ac7
hexd0ae05d39

56017050937 has 2 divisors, whose sum is σ = 56017050938. Its totient is φ = 56017050936.

The previous prime is 56017050833. The next prime is 56017050977. The reversal of 56017050937 is 73905071065.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 47813944896 + 8203106041 = 218664^2 + 90571^2 .

It is a cyclic number.

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

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

It is not a weakly prime, because it can be changed into another prime (56017050977) 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, 28008525468 + 28008525469.

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

Almost surely, 256017050937 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 198450, while the sum is 43.

The spelling of 56017050937 in words is "fifty-six billion, seventeen million, fifty thousand, nine hundred thirty-seven".