Search a number
-
+
5051005097 is a prime number
BaseRepresentation
bin1001011010001000…
…00011100010101001
3111001000100122101212
410231010003202221
540321024130342
62153112322505
7236111556245
oct45504034251
914030318355
105051005097
112162184986
12b8b6a3435
136265a9618
1435cb7b425
151e867e182
hex12d1038a9

5051005097 has 2 divisors, whose sum is σ = 5051005098. Its totient is φ = 5051005096.

The previous prime is 5051005079. The next prime is 5051005129. The reversal of 5051005097 is 7905001505.

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

It is an a-pointer prime, because the next prime (5051005129) can be obtained adding 5051005097 to its sum of digits (32).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3236585881 + 1814419216 = 56891^2 + 42596^2 .

It is a cyclic number.

It is not a de Polignac number, because 5051005097 - 28 = 5051004841 is a prime.

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

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

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

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

Almost surely, 25051005097 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 5051005097 is about 71070.4235037333. The cubic root of 5051005097 is about 1715.7707859640.

The spelling of 5051005097 in words is "five billion, fifty-one million, five thousand, ninety-seven".