Base | Representation |
---|---|
bin | 11001001100000… |
… | …01010110100000 |
3 | 112201120211022220 |
4 | 30212001112200 |
5 | 413042343400 |
6 | 32544431040 |
7 | 5143652220 |
oct | 1446012640 |
9 | 481524286 |
10 | 211293600 |
11 | a92a7011 |
12 | 5a918480 |
13 | 34a0c8cb |
14 | 200c2080 |
15 | 1383a7a0 |
hex | c9815a0 |
211293600 has 144 divisors (see below), whose sum is σ = 786074688. Its totient is φ = 48291840.
The previous prime is 211293587. The next prime is 211293601. The reversal of 211293600 is 6392112.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (211293601) 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, 10512 + ... + 23088.
It is an arithmetic number, because the mean of its divisors is an integer number (5458852).
Almost surely, 2211293600 is an apocalyptic number.
211293600 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 211293600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (393037344).
211293600 is an abundant number, since it is smaller than the sum of its proper divisors (574781088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211293600 is a wasteful number, since it uses less digits than its factorization.
211293600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12607 (or 12594 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 24.
The square root of 211293600 is about 14535.9416619633. The cubic root of 211293600 is about 595.6101830620.
The spelling of 211293600 in words is "two hundred eleven million, two hundred ninety-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •