Base | Representation |
---|---|
bin | 1100010010110110110… |
… | …1001000001001110111 |
3 | 202012012022002000020021 |
4 | 3010231231020021313 |
5 | 11430034332431403 |
6 | 241011101550011 |
7 | 21155143044331 |
oct | 3045555101167 |
9 | 665168060207 |
10 | 211220202103 |
11 | 8163a3300a9 |
12 | 34b29275307 |
13 | 16bc1a55211 |
14 | a31a312451 |
15 | 576350d8bd |
hex | 312db48277 |
211220202103 has 2 divisors, whose sum is σ = 211220202104. Its totient is φ = 211220202102.
The previous prime is 211220202059. The next prime is 211220202133. The reversal of 211220202103 is 301202022112.
It is a happy number.
211220202103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211220202103 - 217 = 211220071031 is a prime.
It is a super-2 number, since 2×2112202021032 (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 (211220202133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105610101051 + 105610101052.
It is an arithmetic number, because the mean of its divisors is an integer number (105610101052).
Almost surely, 2211220202103 is an apocalyptic number.
211220202103 is a deficient number, since it is larger than the sum of its proper divisors (1).
211220202103 is an equidigital number, since it uses as much as digits as its factorization.
211220202103 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 16.
Adding to 211220202103 its reverse (301202022112), we get a palindrome (512422224215).
The spelling of 211220202103 in words is "two hundred eleven billion, two hundred twenty million, two hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •