Base | Representation |
---|---|
bin | 101101100001011100001100… |
… | …011111111011100110010011 |
3 | 222020212220021211001010110111 |
4 | 231201130030133323212103 |
5 | 202220220301202401321 |
6 | 1545451131020142151 |
7 | 60112463112461056 |
oct | 5541341437734623 |
9 | 866786254033414 |
10 | 200210110200211 |
11 | 5887a6a3817611 |
12 | 1a556088997957 |
13 | 879396a070a37 |
14 | 3762314752a9d |
15 | 1822dceddd5e1 |
hex | b6170c7fb993 |
200210110200211 has 2 divisors, whose sum is σ = 200210110200212. Its totient is φ = 200210110200210.
The previous prime is 200210110200173. The next prime is 200210110200223. The reversal of 200210110200211 is 112002011012002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 200210110200211 - 215 = 200210110167443 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200210110200191 and 200210110200200.
It is not a weakly prime, because it can be changed into another prime (200210110200511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105055100105 + 100105055100106.
It is an arithmetic number, because the mean of its divisors is an integer number (100105055100106).
Almost surely, 2200210110200211 is an apocalyptic number.
200210110200211 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210110200211 is an equidigital number, since it uses as much as digits as its factorization.
200210110200211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 200210110200211 its reverse (112002011012002), we get a palindrome (312212121212213).
The spelling of 200210110200211 in words is "two hundred trillion, two hundred ten billion, one hundred ten million, two hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •