Search a number
-
+
200211010157 is a prime number
BaseRepresentation
bin1011101001110110000…
…0011001001001101101
3201010210001100010000102
42322131200121021231
511240013004311112
6231550424440445
720315262335654
oct2723540311155
9633701303012
10200211010157
11779aa994264
1232976319125
1315b58c5ca62
14999412c19b
15531bc55bc2
hex2e9d81926d

200211010157 has 2 divisors, whose sum is σ = 200211010158. Its totient is φ = 200211010156.

The previous prime is 200211010151. The next prime is 200211010277. The reversal of 200211010157 is 751010112002.

It is a happy number.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 191230415401 + 8980594756 = 437299^2 + 94766^2 .

It is a cyclic number.

It is not a de Polignac number, because 200211010157 - 210 = 200211009133 is a prime.

It is a congruent number.

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

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

Almost surely, 2200211010157 is an apocalyptic number.

It is an amenable number.

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

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

200211010157 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 20.

Adding to 200211010157 its reverse (751010112002), we get a palindrome (951221122159).

The spelling of 200211010157 in words is "two hundred billion, two hundred eleven million, ten thousand, one hundred fifty-seven".