Base | Representation |
---|---|
bin | 1100010010011100100… |
… | …1001010100001010000 |
3 | 202011220121220211001120 |
4 | 3010213021022201100 |
5 | 11424323142030222 |
6 | 240552130202240 |
7 | 21152335224042 |
oct | 3044711124120 |
9 | 664817824046 |
10 | 211110111312 |
11 | 81593177281 |
12 | 34ab8423380 |
13 | 16ba4cba739 |
14 | a309855a92 |
15 | 5758a1415c |
hex | 312724a850 |
211110111312 has 80 divisors (see below), whose sum is σ = 557608810752. Its totient is φ = 68793978880.
The previous prime is 211110111299. The next prime is 211110111323. The reversal of 211110111312 is 213111011112.
It is a super-2 number, since 2×2111101113122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211110111291 and 211110111300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1934428 + ... + 2040644.
Almost surely, 2211110111312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 211110111312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (278804405376).
211110111312 is an abundant number, since it is smaller than the sum of its proper divisors (346498699440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211110111312 is a wasteful number, since it uses less digits than its factorization.
211110111312 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 107156 (or 107150 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 211110111312 its reverse (213111011112), we get a palindrome (424221122424).
The spelling of 211110111312 in words is "two hundred eleven billion, one hundred ten million, one hundred eleven thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •