Base | Representation |
---|---|
bin | 101101100001011100010010… |
… | …100101000010001010111111 |
3 | 222020212220112220222022110002 |
4 | 231201130102211002022333 |
5 | 202220221003310414101 |
6 | 1545451145102304515 |
7 | 60112465461455645 |
oct | 5541342245021277 |
9 | 866786486868402 |
10 | 200210212201151 |
11 | 5887a746355409 |
12 | 1a5560b6b8813b |
13 | 8793985235219 |
14 | 3762324105195 |
15 | 1822dd8d3ad6b |
hex | b617129422bf |
200210212201151 has 2 divisors, whose sum is σ = 200210212201152. Its totient is φ = 200210212201150.
The previous prime is 200210212201009. The next prime is 200210212201157. The reversal of 200210212201151 is 151102212012002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210212201151 - 210 = 200210212200127 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210212201157) 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, 100105106100575 + 100105106100576.
It is an arithmetic number, because the mean of its divisors is an integer number (100105106100576).
Almost surely, 2200210212201151 is an apocalyptic number.
200210212201151 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210212201151 is an equidigital number, since it uses as much as digits as its factorization.
200210212201151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 160, while the sum is 20.
Adding to 200210212201151 its reverse (151102212012002), we get a palindrome (351312424213153).
The spelling of 200210212201151 in words is "two hundred trillion, two hundred ten billion, two hundred twelve million, two hundred one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •