Base | Representation |
---|---|
bin | 1100010110100000011… |
… | …1100001101110010110 |
3 | 202021201121010010010210 |
4 | 3011220013201232112 |
5 | 11434041222413420 |
6 | 241252230430250 |
7 | 21221342643312 |
oct | 3055007415626 |
9 | 667647103123 |
10 | 212200201110 |
11 | 81aa2532937 |
12 | 35161502386 |
13 | 17019aab6a1 |
14 | a3b0534b42 |
15 | 57be58d9e0 |
hex | 31681e1b96 |
212200201110 has 64 divisors (see below), whose sum is σ = 516420108288. Its totient is φ = 55793919744.
The previous prime is 212200201099. The next prime is 212200201111. The reversal of 212200201110 is 11102002212.
It is a super-2 number, since 2×2122002011102 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212200201111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7833249 + ... + 7860291.
It is an arithmetic number, because the mean of its divisors is an integer number (8069064192).
Almost surely, 2212200201110 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 212200201110, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (258210054144).
212200201110 is an abundant number, since it is smaller than the sum of its proper divisors (304219907178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212200201110 is a wasteful number, since it uses less digits than its factorization.
212200201110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30709.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 212200201110 its reverse (11102002212), we get a palindrome (223302203322).
The spelling of 212200201110 in words is "two hundred twelve billion, two hundred million, two hundred one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •