Base | Representation |
---|---|
bin | 101110000010… |
… | …0100110010000 |
3 | 1200102020110220 |
4 | 1130010212100 |
5 | 22134323310 |
6 | 2221153040 |
7 | 412103403 |
oct | 134044620 |
9 | 50366426 |
10 | 24136080 |
11 | 12695881 |
12 | 80bb780 |
13 | 5000c07 |
14 | 32c3d3a |
15 | 21bb670 |
hex | 1704990 |
24136080 has 160 divisors (see below), whose sum is σ = 80947200. Its totient is φ = 5930496.
The previous prime is 24136069. The next prime is 24136103. The reversal of 24136080 is 8063142.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 24136080.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 305481 + ... + 305559.
It is an arithmetic number, because the mean of its divisors is an integer number (505920).
Almost surely, 224136080 is an apocalyptic number.
24136080 is a gapful number since it is divisible by the number (20) 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 24136080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40473600).
24136080 is an abundant number, since it is smaller than the sum of its proper divisors (56811120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24136080 is a wasteful number, since it uses less digits than its factorization.
24136080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181 (or 175 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The square root of 24136080 is about 4912.8484609237. The cubic root of 24136080 is about 288.9940572606.
The spelling of 24136080 in words is "twenty-four million, one hundred thirty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •