Search a number
-
+
1010201121157 is a prime number
BaseRepresentation
bin11101011001101001010…
…11011101000110000101
310120120111122122001222011
432230310223131012011
5113022342441334112
62052025135534221
7132661503565024
oct16546453350605
93516448561864
101010201121157
1135a473219238
1214394a38a371
13743528436c7
1436c731a08bb
151b427100aa7
hexeb34add185

1010201121157 has 2 divisors, whose sum is σ = 1010201121158. Its totient is φ = 1010201121156.

The previous prime is 1010201121133. The next prime is 1010201121173. The reversal of 1010201121157 is 7511211020101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 769899198721 + 240301922436 = 877439^2 + 490206^2 .

It is a cyclic number.

It is not a de Polignac number, because 1010201121157 - 215 = 1010201088389 is a prime.

It is a congruent number.

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

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

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

Almost surely, 21010201121157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 140, while the sum is 22.

Adding to 1010201121157 its reverse (7511211020101), we get a palindrome (8521412141258).

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