Base | Representation |
---|---|
bin | 101101100001011100010001… |
… | …111010101110101010111011 |
3 | 222020212220112011002212221011 |
4 | 231201130101322232222323 |
5 | 202220220442441024402 |
6 | 1545451144024454351 |
7 | 60112465265266546 |
oct | 5541342172565273 |
9 | 866786464085834 |
10 | 200210201111227 |
11 | 5887a74007038a |
12 | 1a5560b331a3b7 |
13 | 8793982b51538 |
14 | 376232285985d |
15 | 1822dd7d99ed7 |
hex | b61711eaeabb |
200210201111227 has 2 divisors, whose sum is σ = 200210201111228. Its totient is φ = 200210201111226.
The previous prime is 200210201111191. The next prime is 200210201111237. The reversal of 200210201111227 is 722111102012002.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-200210201111227 is a prime.
It is a super-2 number, since 2×2002102011112272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 200210201111198 and 200210201111207.
It is not a weakly prime, because it can be changed into another prime (200210201111237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100105100555613 + 100105100555614.
It is an arithmetic number, because the mean of its divisors is an integer number (100105100555614).
Almost surely, 2200210201111227 is an apocalyptic number.
200210201111227 is a deficient number, since it is larger than the sum of its proper divisors (1).
200210201111227 is an equidigital number, since it uses as much as digits as its factorization.
200210201111227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 22.
Adding to 200210201111227 its reverse (722111102012002), we get a palindrome (922321303123229).
The spelling of 200210201111227 in words is "two hundred trillion, two hundred ten billion, two hundred one million, one hundred eleven thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •