The number 5968
5968 is a composite number with 10 divisors. Its prime factorisation is × 373. Divisors (10): 1, 2, 4, 8, 16, 373, 746, 1492, 2984, 5968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5968 is composite. Its prime factorisation is
- 3
The divisors add up to 11594; without 5968 itself that is 5626, so 5968 is deficient (5626 is less than 5968). Euler's totient φ(5968) = 2976 numbers up to 5968 share no factor with it.
- 4
The digits of 5968 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 23 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5968 = 2^{4} \times 373 \]5968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 11594 |
| Euler totient φ(n) | 2976 |
| Square | 35617024 |
| Cube | 212562399232 |
| Square root | 77.252832 (= 4√373) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 23 |
| Scientific notation | 5.968 × |
5968 in other forms
| Form | Value |
|---|---|
| In words | five thousand nine hundred and sixty-eight |
| Binary (base 2) | 1011101010000 |
| Octal (base 8) | 13520 |
| Hexadecimal (base 16) | 1750 |
| Base 3 | 22012001 |
| As time | 5968 seconds = 1 h 39 min 28 s |
Is 5968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5968 ÷ 2 = 2984) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5968 ÷ 4 = 1492) | 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 | No (remainder 4) | 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 | Yes (5968 ÷ 8 = 746) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5968 a prime number?
No. 5968 = × 373, so it is divisible by 2.
What are the factors of 5968?
1, 2, 4, 8, 16, 373, 746, 1492, 2984, 5968.
What is 5968 in binary?
1011101010000 (hexadecimal 1750, octal 13520).
What is the square root of 5968?
About 77.2528, exactly 4√373.
Is 5968 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 5968?
It is a composite number with 10 divisors.