Base | Representation |
---|---|
bin | 101010001010… |
… | …101000100000 |
3 | 202210120200121 |
4 | 222022220200 |
5 | 10312203400 |
6 | 1032530024 |
7 | 162645145 |
oct | 52125040 |
9 | 22716617 |
10 | 11053600 |
11 | 626a808 |
12 | 3850914 |
13 | 23a02bc |
14 | 167a3cc |
15 | e8521a |
hex | a8aa20 |
11053600 has 72 divisors (see below), whose sum is σ = 27724788. Its totient is φ = 4300800.
The previous prime is 11053583. The next prime is 11053607. The reversal of 11053600 is 635011.
It can be written as a sum of positive squares in 6 ways, for example, as 633616 + 10419984 = 796^2 + 3228^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (11053607) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32632 + ... + 32968.
Almost surely, 211053600 is an apocalyptic number.
11053600 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 11053600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13862394).
11053600 is an abundant number, since it is smaller than the sum of its proper divisors (16671188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11053600 is a wasteful number, since it uses less digits than its factorization.
11053600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 398 (or 385 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 11053600 is about 3324.6954747766. The cubic root of 11053600 is about 222.7586521992.
Adding to 11053600 its reverse (635011), we get a palindrome (11688611).
The spelling of 11053600 in words is "eleven million, fifty-three thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •