Base | Representation |
---|---|
bin | 1011101001110110000… |
… | …0101111000111110111 |
3 | 201010210001111200110112 |
4 | 2322131200233013313 |
5 | 11240013020201101 |
6 | 231550430413235 |
7 | 20315263162226 |
oct | 2723540570767 |
9 | 633701450415 |
10 | 200211100151 |
11 | 779aaa45937 |
12 | 3297636121b |
13 | 15b58c919ca |
14 | 9994152cbd |
15 | 531bc726bb |
hex | 2e9d82f1f7 |
200211100151 has 2 divisors, whose sum is σ = 200211100152. Its totient is φ = 200211100150.
The previous prime is 200211100093. The next prime is 200211100207. The reversal of 200211100151 is 151001112002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200211100151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200211100351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105550075 + 100105550076.
It is an arithmetic number, because the mean of its divisors is an integer number (100105550076).
Almost surely, 2200211100151 is an apocalyptic number.
200211100151 is a deficient number, since it is larger than the sum of its proper divisors (1).
200211100151 is an equidigital number, since it uses as much as digits as its factorization.
200211100151 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 200211100151 its reverse (151001112002), we get a palindrome (351212212153).
The spelling of 200211100151 in words is "two hundred billion, two hundred eleven million, one hundred thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •