Base | Representation |
---|---|
bin | 101111011100… |
… | …0110010011100 |
3 | 1201210201220110 |
4 | 1132320302130 |
5 | 22331433030 |
6 | 2245050020 |
7 | 421266234 |
oct | 136706234 |
9 | 51721813 |
10 | 24874140 |
11 | 1304a345 |
12 | 83b6910 |
13 | 51cbb35 |
14 | 3436cc4 |
15 | 22b51b0 |
hex | 17b8c9c |
24874140 has 48 divisors (see below), whose sum is σ = 70640640. Its totient is φ = 6538560.
The previous prime is 24874123. The next prime is 24874163. The reversal of 24874140 is 4147842.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 24874098 and 24874107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1341 + ... + 7179.
It is an arithmetic number, because the mean of its divisors is an integer number (1471680).
Almost surely, 224874140 is an apocalyptic number.
24874140 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 24874140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35320320).
24874140 is an abundant number, since it is smaller than the sum of its proper divisors (45766500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
24874140 is a wasteful number, since it uses less digits than its factorization.
24874140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5922 (or 5920 counting only the distinct ones).
The product of its (nonzero) digits is 7168, while the sum is 30.
The square root of 24874140 is about 4987.3981192602. The cubic root of 24874140 is about 291.9102589052.
The spelling of 24874140 in words is "twenty-four million, eight hundred seventy-four thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •