The number 74832
74832 is a composite number with 20 divisors. Its prime factorisation is × 3 × 1559. Divisors (20): 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1559, 3118, 4677, 6236, 9354, 12472 … 74832.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 74832: a Harshad number: divisible by its digit sum 24.
- 2
74832 is composite. Its prime factorisation is
- 3
The divisors add up to 193440; without 74832 itself that is 118608, so 74832 is abundant (118608 is more than 74832). Euler's totient φ(74832) = 24928 numbers up to 74832 share no factor with it.
- 4
The digits of 74832 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 74832 = 2^{4} \times 3 \times 1559 \]74832 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 193440 |
| Euler totient φ(n) | 24928 |
| Square | 5599828224 |
| Cube | 419046345658368 |
| Square root | 273.554382 (= 4√4677) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 63 |
| Scientific notation | 7.4832 × |
74832 in other forms
| Form | Value |
|---|---|
| In words | seventy-four thousand eight hundred and thirty-two |
| Binary (base 2) | 10010010001010000 |
| Octal (base 8) | 222120 |
| Hexadecimal (base 16) | 12450 |
| Base 3 | 10210122120 |
| As time | 74832 seconds = 20 h 47 min 12 s |
Is 74832 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (74832 ÷ 2 = 37416) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (74832 ÷ 3 = 24944) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (74832 ÷ 4 = 18708) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (74832 ÷ 6 = 12472) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | Yes (74832 ÷ 8 = 9354) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (74832 ÷ 12 = 6236) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 74832 a prime number?
No. 74832 = × 3 × 1559, so it is divisible by 2.
What are the factors of 74832?
1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1559, 3118, 4677, 6236, 9354, 12472, 18708, 24944, 37416, 74832.
What is 74832 in binary?
10010010001010000 (hexadecimal 12450, octal 222120).
What is the square root of 74832?
About 273.5544, exactly 4√4677.
Is 74832 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 74832?
74832 is a Harshad number: divisible by its digit sum 24.