Base | Representation |
---|---|
bin | 1100010110001101110… |
… | …1001101101011110000 |
3 | 202021112010222002112112 |
4 | 3011203131031223300 |
5 | 11433411213000422 |
6 | 241240354344452 |
7 | 21216403152131 |
oct | 3054335155360 |
9 | 667463862475 |
10 | 212122000112 |
11 | 81a62380310 |
12 | 3513b28b128 |
13 | 1700682b0c9 |
14 | a3a3db9c88 |
15 | 57b7792ee2 |
hex | 316374daf0 |
212122000112 has 80 divisors (see below), whose sum is σ = 466373587680. Its totient is φ = 92579558400.
The previous prime is 212122000061. The next prime is 212122000133. The reversal of 212122000112 is 211000221212.
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, 809018 + ... + 1038630.
It is an arithmetic number, because the mean of its divisors is an integer number (5829669846).
Almost surely, 2212122000112 is an apocalyptic number.
212122000112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 212122000112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (233186793840).
212122000112 is an abundant number, since it is smaller than the sum of its proper divisors (254251587568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212122000112 is a wasteful number, since it uses less digits than its factorization.
212122000112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 229842 (or 229836 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 212122000112 its reverse (211000221212), we get a palindrome (423122221324).
The spelling of 212122000112 in words is "two hundred twelve billion, one hundred twenty-two million, one hundred twelve", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.117 sec. • engine limits •