Base | Representation |
---|---|
bin | 101011000111… |
… | …111111011100 |
3 | 210021100102220 |
4 | 223013333130 |
5 | 10343224144 |
6 | 1042145340 |
7 | 165042651 |
oct | 53077734 |
9 | 23240386 |
10 | 11304924 |
11 | 6421614 |
12 | 3952250 |
13 | 245a807 |
14 | 1703c28 |
15 | ed4919 |
hex | ac7fdc |
11304924 has 48 divisors (see below), whose sum is σ = 28022400. Its totient is φ = 3537216.
The previous prime is 11304919. The next prime is 11304929. The reversal of 11304924 is 42940311.
It is an interprime number because it is at equal distance from previous prime (11304919) and next prime (11304929).
It is a junction number, because it is equal to n+sod(n) for n = 11304894 and 11304903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11304929) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40674 + ... + 40950.
It is an arithmetic number, because the mean of its divisors is an integer number (583800).
Almost surely, 211304924 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11304924, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14011200).
11304924 is an abundant number, since it is smaller than the sum of its proper divisors (16717476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11304924 is a wasteful number, since it uses less digits than its factorization.
11304924 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 482 (or 480 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
The square root of 11304924 is about 3362.2795838538. The cubic root of 11304924 is about 224.4342924388.
The spelling of 11304924 in words is "eleven million, three hundred four thousand, nine hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •