The number 4968
4968 is a composite number with 32 divisors. Its prime factorisation is × × 23. Divisors (32): 1, 2, 3, 4, 6, 8, 9, 12, 18, 23, 24, 27, 36, 46, 54, 69 … 4968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4968: a Harshad number: divisible by its digit sum 27.
- 2
4968 is composite. Its prime factorisation is
- 3
The divisors add up to 14400; without 4968 itself that is 9432, so 4968 is abundant (9432 is more than 4968). Euler's totient φ(4968) = 1584 numbers up to 4968 share no factor with it.
- 4
The digits of 4968 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 90 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4968 = 2^{3} \times 3^{3} \times 23 \]4968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 14400 |
| Euler totient φ(n) | 1584 |
| Square | 24681024 |
| Cube | 122615327232 |
| Square root | 70.484041 (= 6√138) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 90 |
| Scientific notation | 4.968 × |
4968 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and sixty-eight |
| Binary (base 2) | 1001101101000 |
| Octal (base 8) | 11550 |
| Hexadecimal (base 16) | 1368 |
| Base 3 | 20211000 |
| As time | 4968 seconds = 1 h 22 min 48 s |
Is 4968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4968 ÷ 2 = 2484) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (4968 ÷ 3 = 1656) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (4968 ÷ 4 = 1242) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (4968 ÷ 6 = 828) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (4968 ÷ 8 = 621) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (4968 ÷ 9 = 552) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (4968 ÷ 12 = 414) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4968 a prime number?
No. 4968 = × × 23, so it is divisible by 2.
What are the factors of 4968?
1, 2, 3, 4, 6, 8, 9, 12, 18, 23, 24, 27, 36, 46, 54, 69, 72, 92, 108, 138, 184, 207, 216, 276, 414, 552, 621, 828, 1242, 1656, 2484, 4968.
What is 4968 in binary?
1001101101000 (hexadecimal 1368, octal 11550).
What is the square root of 4968?
About 70.4840, exactly 6√138.
Is 4968 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 4968?
4968 is a Harshad number: divisible by its digit sum 27.