Search a number
-
+
51031111237 is a prime number
BaseRepresentation
bin101111100001101100…
…001111011001000101
311212201110001001022221
4233201230033121011
51314002431024422
635235433452341
73454412200651
oct574154173105
9155643031287
1051031111237
111a7078061a7
129a822710b1
134a73580912
142681659a61
1514da16e3c7
hexbe1b0f645

51031111237 has 2 divisors, whose sum is σ = 51031111238. Its totient is φ = 51031111236.

The previous prime is 51031111223. The next prime is 51031111273. The reversal of 51031111237 is 73211113015.

Together with next prime (51031111273) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 50858819361 + 172291876 = 225519^2 + 13126^2 .

It is a cyclic number.

It is not a de Polignac number, because 51031111237 - 219 = 51030586949 is a prime.

It is a congruent number.

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

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

Almost surely, 251031111237 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 630, while the sum is 25.

The spelling of 51031111237 in words is "fifty-one billion, thirty-one million, one hundred eleven thousand, two hundred thirty-seven".