The number 59968
59968 is a composite number with 14 divisors. Its prime factorisation is × 937. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 937, 1874, 3748, 7496, 14992, 29984, 59968.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59968 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59968 is composite. Its prime factorisation is
- 3
The divisors add up to 119126; without 59968 itself that is 59158, so 59968 is deficient (59158 is less than 59968). Euler's totient φ(59968) = 29952 numbers up to 59968 share no factor with it.
- 4
The digits of 59968 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59968 = 2^{6} \times 937 \]59968 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 119126 |
| Euler totient φ(n) | 29952 |
| Square | 3596161024 |
| Cube | 215654584287232 |
| Square root | 244.883646 (= 8√937) |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 179 |
| Scientific notation | 5.9968 × |
59968 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and sixty-eight |
| Binary (base 2) | 1110101001000000 |
| Octal (base 8) | 165100 |
| Hexadecimal (base 16) | EA40 |
| Base 3 | 10001021001 |
| As time | 59968 seconds = 16 h 39 min 28 s |
Is 59968 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59968 ÷ 2 = 29984) | 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 (59968 ÷ 4 = 14992) | 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 6) | 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 (59968 ÷ 8 = 7496) | 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 7) | 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 59968 a prime number?
No. 59968 = × 937, so it is divisible by 2.
What are the factors of 59968?
1, 2, 4, 8, 16, 32, 64, 937, 1874, 3748, 7496, 14992, 29984, 59968.
What is 59968 in binary?
1110101001000000 (hexadecimal EA40, octal 165100).
What is the square root of 59968?
About 244.8836, exactly 8√937.
Is 59968 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 59968?
It is a composite number with 14 divisors.