Base | Representation |
---|---|
bin | 101010011100… |
… | …010000000000 |
3 | 202221020200012 |
4 | 222130100000 |
5 | 10322011020 |
6 | 1034244052 |
7 | 163365422 |
oct | 52342000 |
9 | 22836605 |
10 | 11125760 |
11 | 6309a48 |
12 | 3886628 |
13 | 23c70b9 |
14 | 1698812 |
15 | e9b7c5 |
hex | a9c400 |
11125760 has 88 divisors (see below), whose sum is σ = 27855576. Its totient is φ = 4259840.
The previous prime is 11125757. The next prime is 11125781. The reversal of 11125760 is 6752111.
It can be written as a sum of positive squares in 4 ways, for example, as 262144 + 10863616 = 512^2 + 3296^2 .
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 7 ways as a sum of consecutive naturals, for example, 209894 + ... + 209946.
Almost surely, 211125760 is an apocalyptic number.
11125760 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 11125760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13927788).
11125760 is an abundant number, since it is smaller than the sum of its proper divisors (16729816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11125760 is an equidigital number, since it uses as much as digits as its factorization.
11125760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 119 (or 101 counting only the distinct ones).
The product of its (nonzero) digits is 420, while the sum is 23.
The square root of 11125760 is about 3335.5299429026. The cubic root of 11125760 is about 223.2423381186.
Adding to 11125760 its reverse (6752111), we get a palindrome (17877871).
The spelling of 11125760 in words is "eleven million, one hundred twenty-five thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •