Base | Representation |
---|---|
bin | 1100010110001000101… |
… | …0000110100111010000 |
3 | 202021110121222012111212 |
4 | 3011202022012213100 |
5 | 11433340123310300 |
6 | 241234255355252 |
7 | 21216020031341 |
oct | 3054212064720 |
9 | 667417865455 |
10 | 212100213200 |
11 | 81a5104a4a7 |
12 | 35133b22b28 |
13 | 17002170545 |
14 | a3a11480c8 |
15 | 57b58dc935 |
hex | 31622869d0 |
212100213200 has 120 divisors (see below), whose sum is σ = 532261766400. Its totient is φ = 81069626880.
The previous prime is 212100213197. The next prime is 212100213239. The reversal of 212100213200 is 2312001212.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9547706 + ... + 9569894.
It is an arithmetic number, because the mean of its divisors is an integer number (4435514720).
Almost surely, 2212100213200 is an apocalyptic number.
212100213200 is a gapful number since it is divisible by the number (20) 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 212100213200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (266130883200).
212100213200 is an abundant number, since it is smaller than the sum of its proper divisors (320161553200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212100213200 is a wasteful number, since it uses less digits than its factorization.
212100213200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23269 (or 23258 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 212100213200 its reverse (2312001212), we get a palindrome (214412214412).
The spelling of 212100213200 in words is "two hundred twelve billion, one hundred million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •