Base | Representation |
---|---|
bin | 110000000000001100110101… |
… | …010001001001000111001100 |
3 | 1000200111212122120101100122212 |
4 | 300000030311101021013030 |
5 | 210132442240321333400 |
6 | 2025003105535525552 |
7 | 62316626454302444 |
oct | 6000146521110714 |
9 | 1020455576340585 |
10 | 211120011121100 |
11 | 612a6548432874 |
12 | 1b8185806898b8 |
13 | 90a56bac92213 |
14 | 3a1c397b99124 |
15 | 1961ab1699335 |
hex | c003354491cc |
211120011121100 has 18 divisors (see below), whose sum is σ = 458130424133004. Its totient is φ = 84448004448400.
The previous prime is 211120011121087. The next prime is 211120011121109. The reversal of 211120011121100 is 1121110021112.
It is not an unprimeable number, because it can be changed into a prime (211120011121109) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1055600055506 + ... + 1055600055705.
Almost surely, 2211120011121100 is an apocalyptic number.
211120011121100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211120011121100 is an abundant number, since it is smaller than the sum of its proper divisors (247010413011904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211120011121100 is a wasteful number, since it uses less digits than its factorization.
211120011121100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2111200111225 (or 2111200111218 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 211120011121100 its reverse (1121110021112), we get a palindrome (212241121142212).
The spelling of 211120011121100 in words is "two hundred eleven trillion, one hundred twenty billion, eleven million, one hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •