Base | Representation |
---|---|
bin | 1011101001110101110… |
… | …0111101101011110101 |
3 | 201010202222122102220111 |
4 | 2322131130331223311 |
5 | 11240012242024341 |
6 | 231550353303021 |
7 | 20315251603111 |
oct | 2723534755365 |
9 | 633688572814 |
10 | 200210111221 |
11 | 779aa42a93a |
12 | 32975b64a71 |
13 | 15b58a06843 |
14 | 9993d76741 |
15 | 531bb29681 |
hex | 2e9d73daf5 |
200210111221 has 2 divisors, whose sum is σ = 200210111222. Its totient is φ = 200210111220.
The previous prime is 200210111207. The next prime is 200210111237. The reversal of 200210111221 is 122111012002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 171007060900 + 29203050321 = 413530^2 + 170889^2 .
It is a cyclic number.
It is not a de Polignac number, because 200210111221 - 213 = 200210103029 is a prime.
It is a super-2 number, since 2×2002101112212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (200210111821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105055610 + 100105055611.
It is an arithmetic number, because the mean of its divisors is an integer number (100105055611).
Almost surely, 2200210111221 is an apocalyptic number.
It is an amenable number.
200210111221 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210111221 is an equidigital number, since it uses as much as digits as its factorization.
200210111221 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 200210111221 its reverse (122111012002), we get a palindrome (322321123223).
The spelling of 200210111221 in words is "two hundred billion, two hundred ten million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •