Base | Representation |
---|---|
bin | 101011010111… |
… | …001011000000 |
3 | 210101111201212 |
4 | 223113023000 |
5 | 10402221404 |
6 | 1043345252 |
7 | 165422150 |
oct | 53271300 |
9 | 23344655 |
10 | 11367104 |
11 | 6464301 |
12 | 3982228 |
13 | 247cbc8 |
14 | 171c760 |
15 | ee806e |
hex | ad72c0 |
11367104 has 28 divisors (see below), whose sum is σ = 25779984. Its totient is φ = 4871424.
The previous prime is 11367089. The next prime is 11367119. The reversal of 11367104 is 40176311.
It is an interprime number because it is at equal distance from previous prime (11367089) and next prime (11367119).
It is a tau number, because it is divible by the number of its divisors (28).
It is a super-2 number, since 2×113671042 = 258422106693632, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11367104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12239 + ... + 13134.
Almost surely, 211367104 is an apocalyptic number.
11367104 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
11367104 is an abundant number, since it is smaller than the sum of its proper divisors (14412880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11367104 is an equidigital number, since it uses as much as digits as its factorization.
11367104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25392 (or 25382 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 23.
The square root of 11367104 is about 3371.5136066758. The cubic root of 11367104 is about 224.8450224958.
The spelling of 11367104 in words is "eleven million, three hundred sixty-seven thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •