Search a number
-
+
51011101061 is a prime number
BaseRepresentation
bin101111100000011111…
…111010000110000101
311212200001101102112022
4233200133322012011
51313432320213221
635233440532525
73454050130154
oct574037720605
9155601342468
1051011101061
111a6a7489268
129a77621145
134a6c39598b
14267cb2b59b
1514d851a4ab
hexbe07fa185

51011101061 has 2 divisors, whose sum is σ = 51011101062. Its totient is φ = 51011101060.

The previous prime is 51011100971. The next prime is 51011101069. The reversal of 51011101061 is 16010111015.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 32209480900 + 18801620161 = 179470^2 + 137119^2 .

It is a cyclic number.

It is not a de Polignac number, because 51011101061 - 210 = 51011100037 is a prime.

It is a congruent number.

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

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

Almost surely, 251011101061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 17.

Adding to 51011101061 its reverse (16010111015), we get a palindrome (67021212076).

The spelling of 51011101061 in words is "fifty-one billion, eleven million, one hundred one thousand, sixty-one".