Base | Representation |
---|---|
bin | 101010110001… |
… | …100000000000 |
3 | 210002200001220 |
4 | 222301200000 |
5 | 10332302200 |
6 | 1040155040 |
7 | 164210244 |
oct | 52614000 |
9 | 23080056 |
10 | 11212800 |
11 | 6369385 |
12 | 3908a80 |
13 | 24278c1 |
14 | 16bc424 |
15 | eb74a0 |
hex | ab1800 |
11212800 has 144 divisors (see below), whose sum is σ = 37575720. Its totient is φ = 2949120.
The previous prime is 11212787. The next prime is 11212823. The reversal of 11212800 is 821211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11212800.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 153564 + ... + 153636.
Almost surely, 211212800 is an apocalyptic number.
11212800 is a gapful number since it is divisible by the number (10) 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 11212800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18787860).
11212800 is an abundant number, since it is smaller than the sum of its proper divisors (26362920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11212800 is an equidigital number, since it uses as much as digits as its factorization.
11212800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108 (or 83 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
The square root of 11212800 is about 3348.5519258330. The cubic root of 11212800 is about 223.8229894102.
The spelling of 11212800 in words is "eleven million, two hundred twelve thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •