Search a number
-
+
2000101157 is a prime number
BaseRepresentation
bin111011100110111…
…0001111100100101
312011101112122222122
41313031301330211
513044011214112
6530245035325
7100364402465
oct16715617445
95141478878
102000101157
1193700666a
124799b5b45
1325b4b1412
1414d8c3ba5
15ba8d2872
hex77371f25

2000101157 has 2 divisors, whose sum is σ = 2000101158. Its totient is φ = 2000101156.

The previous prime is 2000101111. The next prime is 2000101171. The reversal of 2000101157 is 7511010002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1926244321 + 73856836 = 43889^2 + 8594^2 .

It is a cyclic number.

It is not a de Polignac number, because 2000101157 - 26 = 2000101093 is a prime.

It is a congruent number.

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

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

Almost surely, 22000101157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 70, while the sum is 17.

The square root of 2000101157 is about 44722.4905053375. The cubic root of 2000101157 is about 1259.9422911757.

Adding to 2000101157 its reverse (7511010002), we get a palindrome (9511111159).

The spelling of 2000101157 in words is "two billion, one hundred one thousand, one hundred fifty-seven".