Base | Representation |
---|---|
bin | 110000000000000011100001… |
… | …001010101010010000011000 |
3 | 1000200110220211120212222112212 |
4 | 300000003201022222100120 |
5 | 210132311300102413422 |
6 | 2024554333321254252 |
7 | 62316123566006351 |
oct | 6000034112522030 |
9 | 1020426746788485 |
10 | 211110010201112 |
11 | 612a228614a640 |
12 | 1b81664b334388 |
13 | 90a4786042099 |
14 | 3a1bac9876d28 |
15 | 19616c86a89e2 |
hex | c000e12aa418 |
211110010201112 has 32 divisors (see below), whose sum is σ = 431816567616000. Its totient is φ = 95958953844000.
The previous prime is 211110010201073. The next prime is 211110010201121. The reversal of 211110010201112 is 211102010011112.
It is a super-2 number, since 2×2111100102011122 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
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, 78936389 + ... + 81566987.
It is an arithmetic number, because the mean of its divisors is an integer number (13494267738000).
Almost surely, 2211110010201112 is an apocalyptic number.
211110010201112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
211110010201112 is an abundant number, since it is smaller than the sum of its proper divisors (220706557414888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211110010201112 is a wasteful number, since it uses less digits than its factorization.
211110010201112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3542567 (or 3542563 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 211110010201112 its reverse (211102010011112), we get a palindrome (422212020212224).
The spelling of 211110010201112 in words is "two hundred eleven trillion, one hundred ten billion, ten million, two hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •