Base | Representation |
---|---|
bin | 11110101101000111000… |
… | …011101110111001110101 |
3 | 21110201022222221222111221 |
4 | 132231013003232321311 |
5 | 234032310400300341 |
6 | 4253155203030341 |
7 | 305305201310653 |
oct | 36550703567165 |
9 | 7421288858457 |
10 | 2110021103221 |
11 | 7439449a5079 |
12 | 2a0b2996b3b1 |
13 | 123c8823c895 |
14 | 741a87a7dd3 |
15 | 39d46d92ed1 |
hex | 1eb470eee75 |
2110021103221 has 2 divisors, whose sum is σ = 2110021103222. Its totient is φ = 2110021103220.
The previous prime is 2110021103219. The next prime is 2110021103233. The reversal of 2110021103221 is 1223011200112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1652214598225 + 457806504996 = 1285385^2 + 676614^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110021103221 - 21 = 2110021103219 is a prime.
Together with 2110021103219, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 2110021103195 and 2110021103204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2110021103251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055010551610 + 1055010551611.
It is an arithmetic number, because the mean of its divisors is an integer number (1055010551611).
Almost surely, 22110021103221 is an apocalyptic number.
It is an amenable number.
2110021103221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110021103221 is an equidigital number, since it uses as much as digits as its factorization.
2110021103221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 2110021103221 its reverse (1223011200112), we get a palindrome (3333032303333).
The spelling of 2110021103221 in words is "two trillion, one hundred ten billion, twenty-one million, one hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •