The number 4992
4992 is a composite number with 32 divisors. Its prime factorisation is × 3 × 13. Divisors (32): 1, 2, 3, 4, 6, 8, 12, 13, 16, 24, 26, 32, 39, 48, 52, 64 … 4992.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4992: a Harshad number: divisible by its digit sum 24.
- 2
4992 is composite. Its prime factorisation is
- 3
The divisors add up to 14280; without 4992 itself that is 9288, so 4992 is abundant (9288 is more than 4992). Euler's totient φ(4992) = 1536 numbers up to 4992 share no factor with it.
- 4
The digits of 4992 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4992 = 2^{7} \times 3 \times 13 \]4992 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 14280 |
| Euler totient φ(n) | 1536 |
| Square | 24920064 |
| Cube | 124400959488 |
| Square root | 70.654087 (= 8√78) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 41 |
| Scientific notation | 4.992 × |
4992 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and ninety-two |
| Binary (base 2) | 1001110000000 |
| Octal (base 8) | 11600 |
| Hexadecimal (base 16) | 1380 |
| Base 3 | 20211220 |
| As time | 4992 seconds = 1 h 23 min 12 s |
Is 4992 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4992 ÷ 2 = 2496) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (4992 ÷ 3 = 1664) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (4992 ÷ 4 = 1248) | 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 (4992 ÷ 6 = 832) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (4992 ÷ 8 = 624) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (4992 ÷ 12 = 416) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4992 a prime number?
No. 4992 = × 3 × 13, so it is divisible by 2.
What are the factors of 4992?
1, 2, 3, 4, 6, 8, 12, 13, 16, 24, 26, 32, 39, 48, 52, 64, 78, 96, 104, 128, 156, 192, 208, 312, 384, 416, 624, 832, 1248, 1664, 2496, 4992.
What is 4992 in binary?
1001110000000 (hexadecimal 1380, octal 11600).
What is the square root of 4992?
About 70.6541, exactly 8√78.
Is 4992 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 4992?
4992 is a Harshad number: divisible by its digit sum 24.