Base | Representation |
---|---|
bin | 101010111000… |
… | …110110011100 |
3 | 210011012101000 |
4 | 222320312130 |
5 | 10334233113 |
6 | 1040550300 |
7 | 164364105 |
oct | 52706634 |
9 | 23135330 |
10 | 11242908 |
11 | 6389a66 |
12 | 3922390 |
13 | 2438511 |
14 | 16c93ac |
15 | ec1373 |
hex | ab8d9c |
11242908 has 48 divisors (see below), whose sum is σ = 30688000. Its totient is φ = 3549744.
The previous prime is 11242901. The next prime is 11242937. The reversal of 11242908 is 80924211.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11242901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 688 + ... + 4791.
Almost surely, 211242908 is an apocalyptic number.
11242908 is a gapful number since it is divisible by the number (18) 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 11242908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15344000).
11242908 is an abundant number, since it is smaller than the sum of its proper divisors (19445092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11242908 is a wasteful number, since it uses less digits than its factorization.
11242908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5511 (or 5503 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The square root of 11242908 is about 3353.0445866406. The cubic root of 11242908 is about 224.0231428045.
The spelling of 11242908 in words is "eleven million, two hundred forty-two thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •