Search a number
-
+
1000211011157 is a prime number
BaseRepresentation
bin11101000111000010011…
…10001101011001010101
310112121201102110220101002
432203201032031121111
5112341413004324112
62043253545113045
7132156106213631
oct16434116153125
93477642426332
101000211011157
11356207049786
12141a20788785
137341cc09a07
14365a6493dc1
151b0400481c2
hexe8e138d655

1000211011157 has 2 divisors, whose sum is σ = 1000211011158. Its totient is φ = 1000211011156.

The previous prime is 1000211011103. The next prime is 1000211011159. The reversal of 1000211011157 is 7511101120001.

1000211011157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 702958157476 + 297252853681 = 838426^2 + 545209^2 .

It is a cyclic number.

It is not a de Polignac number, because 1000211011157 - 216 = 1000210945621 is a prime.

Together with 1000211011159, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 21000211011157 is an apocalyptic number.

It is an amenable number.

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

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

1000211011157 is an evil number, because the sum of its binary digits is even.

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

Adding to 1000211011157 its reverse (7511101120001), we get a palindrome (8511312131158).

The spelling of 1000211011157 in words is "one trillion, two hundred eleven million, eleven thousand, one hundred fifty-seven".