Search a number
-
+
51123504713 is a prime number
BaseRepresentation
bin101111100111001100…
…101100011001001001
311212221212220010100112
4233213030230121021
51314200104122323
635252534044105
73456613422461
oct574714543111
9155855803315
1051123504713
111a754981846
129aa91a9635
134a89760108
14268da2aba1
1514e3320178
hexbe732c649

51123504713 has 2 divisors, whose sum is σ = 51123504714. Its totient is φ = 51123504712.

The previous prime is 51123504697. The next prime is 51123504797. The reversal of 51123504713 is 31740532115.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 43914136249 + 7209368464 = 209557^2 + 84908^2 .

It is a cyclic number.

It is not a de Polignac number, because 51123504713 - 24 = 51123504697 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 51123504713.

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

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

Almost surely, 251123504713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12600, while the sum is 32.

The spelling of 51123504713 in words is "fifty-one billion, one hundred twenty-three million, five hundred four thousand, seven hundred thirteen".