Base | Representation |
---|---|
bin | 101010000100… |
… | …001001100000 |
3 | 202202020020220 |
4 | 222010021200 |
5 | 10310331130 |
6 | 1032203040 |
7 | 162504543 |
oct | 52041140 |
9 | 22666226 |
10 | 11027040 |
11 | 6251862 |
12 | 3839480 |
13 | 239119b |
14 | 167085a |
15 | e7c410 |
hex | a84260 |
11027040 has 48 divisors (see below), whose sum is σ = 34736688. Its totient is φ = 2940416.
The previous prime is 11027039. The next prime is 11027053. The reversal of 11027040 is 4072011.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×110270402 = 243191222323200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
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 7 ways as a sum of consecutive naturals, for example, 11007 + ... + 11966.
It is an arithmetic number, because the mean of its divisors is an integer number (723681).
Almost surely, 211027040 is an apocalyptic number.
11027040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11027040 is an abundant number, since it is smaller than the sum of its proper divisors (23709648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11027040 is a wasteful number, since it uses less digits than its factorization.
11027040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22991 (or 22983 counting only the distinct ones).
The product of its (nonzero) digits is 56, while the sum is 15.
The square root of 11027040 is about 3320.6987216548. The cubic root of 11027040 is about 222.5800915218.
Adding to 11027040 its reverse (4072011), we get a palindrome (15099051).
The spelling of 11027040 in words is "eleven million, twenty-seven thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •