The number 60964
60964 is a composite number with 6 divisors. Its prime factorisation is × 15241. Divisors (6): 1, 2, 4, 15241, 30482, 60964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60964 is composite. Its prime factorisation is
- 3
The divisors add up to 106694; without 60964 itself that is 45730, so 60964 is deficient (45730 is less than 60964). Euler's totient φ(60964) = 30480 numbers up to 60964 share no factor with it.
- 4
The digits of 60964 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60964 = 2^{2} \times 15241 \]60964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 106694 |
| Euler totient φ(n) | 30480 |
| Square | 3716609296 |
| Cube | 226579369121344 |
| Square root | 246.908890 (= 2√15241) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.0964 × |
60964 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand nine hundred and sixty-four |
| Binary (base 2) | 1110111000100100 |
| Octal (base 8) | 167044 |
| Hexadecimal (base 16) | EE24 |
| Base 3 | 10002121221 |
| As time | 60964 seconds = 16 h 56 min 4 s |
Is 60964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60964 ÷ 2 = 30482) | 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 (60964 ÷ 4 = 15241) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 60964 a prime number?
No. 60964 = × 15241, so it is divisible by 2.
What are the factors of 60964?
1, 2, 4, 15241, 30482, 60964.
What is 60964 in binary?
1110111000100100 (hexadecimal EE24, octal 167044).
What is the square root of 60964?
About 246.9089, exactly 2√15241.
Is 60964 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 60964?
It is a composite number with 6 divisors.