The number 60947
60947 is a composite number with 4 divisors. Its prime factorisation is 59 × 1033. Divisors (4): 1, 59, 1033, 60947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60947: a semiprime: 59 × 1033, the product of two primes.
- 2
60947 is composite. Its prime factorisation is
- 3
The divisors add up to 62040; without 60947 itself that is 1093, so 60947 is deficient (1093 is less than 60947). Euler's totient φ(60947) = 59856 numbers up to 60947 share no factor with it.
- 4
The digits of 60947 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60947 = 59 \times 1033 \]
60947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62040 |
| Euler totient φ(n) | 59856 |
| Square | 3714536809 |
| Cube | 226389874898123 |
| Square root | 246.874462 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 91 |
| Scientific notation | 6.0947 × |
60947 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand nine hundred and forty-seven |
| Binary (base 2) | 1110111000010011 |
| Octal (base 8) | 167023 |
| Hexadecimal (base 16) | EE13 |
| Base 3 | 10002121022 |
| As time | 60947 seconds = 16 h 55 min 47 s |
Is 60947 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 2) | 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 7) | 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 60947 a prime number?
No. 60947 = 59 × 1033, so it is divisible by 59.
What are the factors of 60947?
1, 59, 1033, 60947.
What is 60947 in binary?
1110111000010011 (hexadecimal EE13, octal 167023).
What is the square root of 60947?
About 246.8745.
Is 60947 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 60947?
60947 is a semiprime: 59 × 1033, the product of two primes.