Base | Representation |
---|---|
bin | 1100010110001001000… |
… | …1010011010011110010 |
3 | 202021110202112002000010 |
4 | 3011202101103103302 |
5 | 11433341114201320 |
6 | 241234404035350 |
7 | 21216042051000 |
oct | 3054221232362 |
9 | 667422462003 |
10 | 212102100210 |
11 | 81a52119210 |
12 | 35134692b56 |
13 | 17002681410 |
14 | a3a14b9a70 |
15 | 57b5b61ae0 |
hex | 31624534f2 |
212102100210 has 1024 divisors, whose sum is σ = 755951616000. Its totient is φ = 37391155200.
The previous prime is 212102100163. The next prime is 212102100211. The reversal of 212102100210 is 12001201212.
It is not an unprimeable number, because it can be changed into a prime (212102100211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 511 ways as a sum of consecutive naturals, for example, 1525914321 + ... + 1525914459.
It is an arithmetic number, because the mean of its divisors is an integer number (738234000).
Almost surely, 2212102100210 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 212102100210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (377975808000).
212102100210 is an abundant number, since it is smaller than the sum of its proper divisors (543849515790).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212102100210 is a wasteful number, since it uses less digits than its factorization.
212102100210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272 (or 258 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 212102100210 its reverse (12001201212), we get a palindrome (224103301422).
The spelling of 212102100210 in words is "two hundred twelve billion, one hundred two million, one hundred thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •