Search a number
-
+
51101000569 is a prime number
BaseRepresentation
bin101111100101110110…
…110110001101111001
311212220022112210110201
4233211312312031321
51314123324004234
635250411442201
73456221223643
oct574566661571
9155808483421
1051101000569
111a743201083
129aa1756361
134a84bb0c58
14268aa4d893
1514e1377314
hexbe5db6379

51101000569 has 2 divisors, whose sum is σ = 51101000570. Its totient is φ = 51101000568.

The previous prime is 51101000539. The next prime is 51101000597. The reversal of 51101000569 is 96500010115.

It is an a-pointer prime, because the next prime (51101000597) can be obtained adding 51101000569 to its sum of digits (28).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 47280153600 + 3820846969 = 217440^2 + 61813^2 .

It is a cyclic number.

It is not a de Polignac number, because 51101000569 - 223 = 51092611961 is a prime.

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

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

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

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

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

Almost surely, 251101000569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1350, while the sum is 28.

The spelling of 51101000569 in words is "fifty-one billion, one hundred one million, five hundred sixty-nine", and thus it is an aban number.