Base | Representation |
---|---|
bin | 1100001110010110010… |
… | …1011000001110000000 |
3 | 202002001222021002202101 |
4 | 3003211211120032000 |
5 | 11420100103224300 |
6 | 240251035400144 |
7 | 21113151225136 |
oct | 3034545301600 |
9 | 662058232671 |
10 | 210010211200 |
11 | 81079320019 |
12 | 3484bbb3054 |
13 | 16a5b17337a |
14 | a243741756 |
15 | 56e219cb6a |
hex | 30e5958380 |
210010211200 has 192 divisors, whose sum is σ = 532769806800. Its totient is φ = 81754767360.
The previous prime is 210010211197. The next prime is 210010211207. The reversal of 210010211200 is 2112010012.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210010211207) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40314196 + ... + 40319404.
Almost surely, 2210010211200 is an apocalyptic number.
210010211200 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 210010211200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (266384903400).
210010211200 is an abundant number, since it is smaller than the sum of its proper divisors (322759595600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210010211200 is a wasteful number, since it uses less digits than its factorization.
210010211200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5569 (or 5552 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 210010211200 its reverse (2112010012), we get a palindrome (212122221212).
The spelling of 210010211200 in words is "two hundred ten billion, ten million, two hundred eleven thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •