Base | Representation |
---|---|
bin | 11001010010001… |
… | …10010000011000 |
3 | 112210002210200000 |
4 | 30221012100120 |
5 | 413244200440 |
6 | 33014013000 |
7 | 5153551461 |
oct | 1451062030 |
9 | 483083600 |
10 | 212100120 |
11 | a97a7a61 |
12 | 5b047160 |
13 | 34c32a3b |
14 | 20251d68 |
15 | 13949730 |
hex | ca46418 |
212100120 has 96 divisors (see below), whose sum is σ = 714888720. Its totient is φ = 56557440.
The previous prime is 212100079. The next prime is 212100121. The reversal of 212100120 is 21001212.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212100121) 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, 1191 + ... + 20630.
Almost surely, 2212100120 is an apocalyptic number.
212100120 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 212100120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (357444360).
212100120 is an abundant number, since it is smaller than the sum of its proper divisors (502788600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212100120 is a wasteful number, since it uses less digits than its factorization.
212100120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21847 (or 21831 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
The square root of 212100120 is about 14563.6575076455. The cubic root of 212100120 is about 596.3670471532.
Adding to 212100120 its reverse (21001212), we get a palindrome (233101332).
The spelling of 212100120 in words is "two hundred twelve million, one hundred thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •