Base | Representation |
---|---|
bin | 110000000000001101000000… |
… | …100010000101000000100000 |
3 | 1000200111220010201222222211220 |
4 | 300000031000202011000200 |
5 | 210132443132212010422 |
6 | 2025003140410335040 |
7 | 62316634240550016 |
oct | 6000150042050040 |
9 | 1020456121888756 |
10 | 211120200110112 |
11 | 612a6635085037 |
12 | 1b818613a2a480 |
13 | 90a571b192737 |
14 | 3a1c3b4d128b6 |
15 | 1961ac307ae5c |
hex | c00340885020 |
211120200110112 has 48 divisors (see below), whose sum is σ = 567078677051040. Its totient is φ = 68736809336832.
The previous prime is 211120200110107. The next prime is 211120200110153. The reversal of 211120200110112 is 211011002021112.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 211120200110091 and 211120200110100.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25571725537 + ... + 25571733792.
It is an arithmetic number, because the mean of its divisors is an integer number (11814139105230).
Almost surely, 2211120200110112 is an apocalyptic number.
It is an amenable number.
211120200110112 is an abundant number, since it is smaller than the sum of its proper divisors (355958476940928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211120200110112 is a wasteful number, since it uses less digits than its factorization.
211120200110112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51143459385 (or 51143459377 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 211120200110112 its reverse (211011002021112), we get a palindrome (422131202131224).
The spelling of 211120200110112 in words is "two hundred eleven trillion, one hundred twenty billion, two hundred million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •