The number 4932
4932 is a composite number with 18 divisors. Its prime factorisation is × × 137. Divisors (18): 1, 2, 3, 4, 6, 9, 12, 18, 36, 137, 274, 411, 548, 822, 1233, 1644 … 4932.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4932: a Harshad number: divisible by its digit sum 18.
- 2
4932 is composite. Its prime factorisation is
- 3
The divisors add up to 12558; without 4932 itself that is 7626, so 4932 is abundant (7626 is more than 4932). Euler's totient φ(4932) = 1632 numbers up to 4932 share no factor with it.
- 4
The digits of 4932 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4932 = 2^{2} \times 3^{2} \times 137 \]4932 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 12558 |
| Euler totient φ(n) | 1632 |
| Square | 24324624 |
| Cube | 119969045568 |
| Square root | 70.228199 (= 6√137) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 134 |
| Scientific notation | 4.932 × |
4932 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and thirty-two |
| Binary (base 2) | 1001101000100 |
| Octal (base 8) | 11504 |
| Hexadecimal (base 16) | 1344 |
| Base 3 | 20202200 |
| As time | 4932 seconds = 1 h 22 min 12 s |
Is 4932 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4932 ÷ 2 = 2466) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (4932 ÷ 3 = 1644) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (4932 ÷ 4 = 1233) | 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 (4932 ÷ 6 = 822) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (4932 ÷ 9 = 548) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (4932 ÷ 12 = 411) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4932 a prime number?
No. 4932 = × × 137, so it is divisible by 2.
What are the factors of 4932?
1, 2, 3, 4, 6, 9, 12, 18, 36, 137, 274, 411, 548, 822, 1233, 1644, 2466, 4932.
What is 4932 in binary?
1001101000100 (hexadecimal 1344, octal 11504).
What is the square root of 4932?
About 70.2282, exactly 6√137.
Is 4932 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 4932?
4932 is a Harshad number: divisible by its digit sum 18.