The number 60959
60959 is a composite number with 4 divisors. Its prime factorisation is 47 × 1297. Divisors (4): 1, 47, 1297, 60959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60959: a semiprime: 47 × 1297, the product of two primes.
- 2
60959 is composite. Its prime factorisation is
- 3
The divisors add up to 62304; without 60959 itself that is 1345, so 60959 is deficient (1345 is less than 60959). Euler's totient φ(60959) = 59616 numbers up to 60959 share no factor with it.
- 4
The digits of 60959 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60959 = 47 \times 1297 \]
60959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62304 |
| Euler totient φ(n) | 59616 |
| Square | 3715999681 |
| Cube | 226523624554079 |
| Square root | 246.898765 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.0959 × |
60959 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand nine hundred and fifty-nine |
| Binary (base 2) | 1110111000011111 |
| Octal (base 8) | 167037 |
| Hexadecimal (base 16) | EE1F |
| Base 3 | 10002121202 |
| As time | 60959 seconds = 16 h 55 min 59 s |
Is 60959 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60959 a prime number?
No. 60959 = 47 × 1297, so it is divisible by 47.
What are the factors of 60959?
1, 47, 1297, 60959.
What is 60959 in binary?
1110111000011111 (hexadecimal EE1F, octal 167037).
What is the square root of 60959?
About 246.8988.
Is 60959 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 60959?
60959 is a semiprime: 47 × 1297, the product of two primes.