Base | Representation |
---|---|
bin | 11110101101000111000… |
… | …011101110001010110011 |
3 | 21110201022222221211101110 |
4 | 132231013003232022303 |
5 | 234032310400201321 |
6 | 4253155203004403 |
7 | 305305201266123 |
oct | 36550703561263 |
9 | 7421288854343 |
10 | 2110021100211 |
11 | 7439449a2892 |
12 | 2a0b29969703 |
13 | 123c8823b3bb |
14 | 741a87a6c83 |
15 | 39d46d92176 |
hex | 1eb470ee2b3 |
2110021100211 has 32 divisors (see below), whose sum is σ = 2996741257216. Its totient is φ = 1318234176000.
The previous prime is 2110021100197. The next prime is 2110021100237. The reversal of 2110021100211 is 1120011200112.
It is not a de Polignac number, because 2110021100211 - 215 = 2110021067443 is a prime.
It is a Duffinian number.
2110021100211 is a modest number, since divided by 21100211 gives 211 as remainder.
It is not an unprimeable number, because it can be changed into a prime (2110028100211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 727030 + ... + 2179131.
It is an arithmetic number, because the mean of its divisors is an integer number (93648164288).
Almost surely, 22110021100211 is an apocalyptic number.
2110021100211 is a deficient number, since it is larger than the sum of its proper divisors (886720157005).
2110021100211 is a wasteful number, since it uses less digits than its factorization.
2110021100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906443.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 2110021100211 its reverse (1120011200112), we get a palindrome (3230032300323).
Subtracting from 2110021100211 its reverse (1120011200112), we obtain a palindrome (990009900099).
The spelling of 2110021100211 in words is "two trillion, one hundred ten billion, twenty-one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •