Search a number
-
+
51115015759 is a prime number
BaseRepresentation
bin101111100110101100…
…010011111001001111
311212221021220211200211
4233212230103321033
51314140421001014
635252032103251
73456451315363
oct574654237117
9155837824624
1051115015759
111a750103985
129aa6394b27
134a87a7a272
14268c85b2a3
1514e26e4cc4
hexbe6b13e4f

51115015759 has 2 divisors, whose sum is σ = 51115015760. Its totient is φ = 51115015758.

The previous prime is 51115015739. The next prime is 51115015799. The reversal of 51115015759 is 95751051115.

It is an a-pointer prime, because the next prime (51115015799) can be obtained adding 51115015759 to its sum of digits (40).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 51115015759 - 27 = 51115015631 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 251115015759 is an apocalyptic number.

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

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

51115015759 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 39375, while the sum is 40.

The spelling of 51115015759 in words is "fifty-one billion, one hundred fifteen million, fifteen thousand, seven hundred fifty-nine".