Search a number
-
+
5056516061 is a prime number
BaseRepresentation
bin1001011010110010…
…00100111111011101
3111001101201122000122
410231121010333131
540323432003221
62153430404325
7236206451222
oct45531047735
914041648018
105056516061
1121652a93a3
12b915006a5
13627788b4c
1435d7b3949
151e8dbbeab
hex12d644fdd

5056516061 has 2 divisors, whose sum is σ = 5056516062. Its totient is φ = 5056516060.

The previous prime is 5056516021. The next prime is 5056516081. The reversal of 5056516061 is 1606156505.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4579093561 + 477422500 = 67669^2 + 21850^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 25056516061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 27000, while the sum is 35.

The square root of 5056516061 is about 71109.1840833517. The cubic root of 5056516061 is about 1716.3945637448.

The spelling of 5056516061 in words is "five billion, fifty-six million, five hundred sixteen thousand, sixty-one".