Search a number
-
+
200211010151 is a prime number
BaseRepresentation
bin1011101001110110000…
…0011001001001100111
3201010210001100010000012
42322131200121021213
511240013004311101
6231550424440435
720315262335645
oct2723540311147
9633701303005
10200211010151
11779aa994259
123297631911b
1315b58c5ca59
14999412c195
15531bc55bbb
hex2e9d819267

200211010151 has 2 divisors, whose sum is σ = 200211010152. Its totient is φ = 200211010150.

The previous prime is 200211010117. The next prime is 200211010157. The reversal of 200211010151 is 151010112002.

200211010151 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 is a cyclic number.

It is not a de Polignac number, because 200211010151 - 230 = 199137268327 is a prime.

It is a congruent number.

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

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

Almost surely, 2200211010151 is an apocalyptic number.

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

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

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

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

Adding to 200211010151 its reverse (151010112002), we get a palindrome (351221122153).

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