Search a number
-
+
51531014531 is a prime number
BaseRepresentation
bin101111111111011111…
…001110000110000011
311221000021200202201202
4233333133032012003
51321013414431111
635401212251415
73502662252653
oct577737160603
9157007622652
1051531014531
111a943a06a17
129ba1770b6b
134b23000999
1426cbbc8363
151518eb8b3b
hexbff7ce183

51531014531 has 2 divisors, whose sum is σ = 51531014532. Its totient is φ = 51531014530.

The previous prime is 51531014471. The next prime is 51531014537. The reversal of 51531014531 is 13541013515.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 51531014531 - 210 = 51531013507 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 51531014494 and 51531014503.

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

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

Almost surely, 251531014531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 29.

The spelling of 51531014531 in words is "fifty-one billion, five hundred thirty-one million, fourteen thousand, five hundred thirty-one".