Search a number
-
+
5010605121157 is a prime number
BaseRepresentation
bin100100011101001111101…
…0101101001111010000101
3122202000020200112002201021
41020322133111221322011
51124043204402334112
614353501253031141
71025001315542536
oct110723725517205
918660220462637
105010605121157
111661a92a67aa9
1268b1096254b1
132a466225129c
1413472c02668d
158a50d7ae907
hex48e9f569e85

5010605121157 has 2 divisors, whose sum is σ = 5010605121158. Its totient is φ = 5010605121156.

The previous prime is 5010605121089. The next prime is 5010605121161. The reversal of 5010605121157 is 7511215060105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4895005801156 + 115599320001 = 2212466^2 + 339999^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-5010605121157 is a prime.

It is a congruent number.

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

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

Almost surely, 25010605121157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10500, while the sum is 34.

The spelling of 5010605121157 in words is "five trillion, ten billion, six hundred five million, one hundred twenty-one thousand, one hundred fifty-seven".