The number 60957
60957 is a composite number with 12 divisors. Its prime factorisation is × 13 × 521. Divisors (12): 1, 3, 9, 13, 39, 117, 521, 1563, 4689, 6773, 20319, 60957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60957 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60957 is composite. Its prime factorisation is
- 3
The divisors add up to 95004; without 60957 itself that is 34047, so 60957 is deficient (34047 is less than 60957). Euler's totient φ(60957) = 37440 numbers up to 60957 share no factor with it.
- 4
The digits of 60957 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 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60957 = 3^{2} \times 13 \times 521 \]60957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 95004 |
| Euler totient φ(n) | 37440 |
| Square | 3715755849 |
| Cube | 226501329287493 |
| Square root | 246.894714 (= 3√6773) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.0957 × |
60957 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand nine hundred and fifty-seven |
| Binary (base 2) | 1110111000011101 |
| Octal (base 8) | 167035 |
| Hexadecimal (base 16) | EE1D |
| Base 3 | 10002121200 |
| As time | 60957 seconds = 16 h 55 min 57 s |
Is 60957 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (60957 ÷ 3 = 20319) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (60957 ÷ 9 = 6773) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60957 a prime number?
No. 60957 = × 13 × 521, so it is divisible by 3.
What are the factors of 60957?
1, 3, 9, 13, 39, 117, 521, 1563, 4689, 6773, 20319, 60957.
What is 60957 in binary?
1110111000011101 (hexadecimal EE1D, octal 167035).
What is the square root of 60957?
About 246.8947, exactly 3√6773.
Is 60957 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 60957?
It is a composite number with 12 divisors.