Search a number
-
+
51390109 is a prime number
BaseRepresentation
bin1100010000001…
…0011010011101
310120200212222101
43010002122131
5101123440414
65033245101
71162544251
oct304023235
9116625871
1051390109
1127010171
1215263791
13a854064
146b7a261
1547a1a74
hex310269d

51390109 has 2 divisors, whose sum is σ = 51390110. Its totient is φ = 51390108.

The previous prime is 51390091. The next prime is 51390137. The reversal of 51390109 is 90109315.

51390109 is nontrivially palindromic in base 15.

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

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 49491225 + 1898884 = 7035^2 + 1378^2 .

It is a cyclic number.

It is not a de Polignac number, because 51390109 - 213 = 51381917 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 251390109 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 51390109 is about 7168.6894897185. The cubic root of 51390109 is about 371.7861264352.

The spelling of 51390109 in words is "fifty-one million, three hundred ninety thousand, one hundred nine".