Base | Representation |
---|---|
bin | 11001010001110… |
… | …10001101110000 |
3 | 112210000022000100 |
4 | 30220322031300 |
5 | 413241111200 |
6 | 33012552400 |
7 | 5153254623 |
oct | 1450721560 |
9 | 483008010 |
10 | 212050800 |
11 | a97739a5 |
12 | 5b022700 |
13 | 34c16460 |
14 | 2023bdba |
15 | 13939d00 |
hex | ca3a370 |
212050800 has 360 divisors, whose sum is σ = 831134304. Its totient is φ = 49674240.
The previous prime is 212050789. The next prime is 212050903. The reversal of 212050800 is 8050212.
It is a tau number, because it is divible by the number of its divisors (360).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1076302 + ... + 1076498.
Almost surely, 2212050800 is an apocalyptic number.
212050800 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 212050800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (415567152).
212050800 is an abundant number, since it is smaller than the sum of its proper divisors (619083504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212050800 is a wasteful number, since it uses less digits than its factorization.
212050800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257 (or 243 counting only the distinct ones).
The product of its (nonzero) digits is 160, while the sum is 18.
The square root of 212050800 is about 14561.9641532315. The cubic root of 212050800 is about 596.3208188235.
The spelling of 212050800 in words is "two hundred twelve million, fifty thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •