The number 60971
60971 is a composite number with 4 divisors. Its prime factorisation is 19 × 3209. Divisors (4): 1, 19, 3209, 60971.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60971: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 19 × 3209, the product of two primes.
- 2
60971 is composite. Its prime factorisation is
- 3
The divisors add up to 64200; without 60971 itself that is 3229, so 60971 is deficient (3229 is less than 60971). Euler's totient φ(60971) = 57744 numbers up to 60971 share no factor with it.
- 4
The digits of 60971 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60971 = 19 \times 3209 \]
60971 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 64200 |
| Euler totient φ(n) | 57744 |
| Square | 3717462841 |
| Cube | 226657426878611 |
| Square root | 246.923065 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.0971 × |
60971 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand nine hundred and seventy-one |
| Binary (base 2) | 1110111000101011 |
| Octal (base 8) | 167053 |
| Hexadecimal (base 16) | EE2B |
| Base 3 | 10002122012 |
| As time | 60971 seconds = 16 h 56 min 11 s |
Is 60971 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 1) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 60971 a prime number?
No. 60971 = 19 × 3209, so it is divisible by 19.
What are the factors of 60971?
1, 19, 3209, 60971.
What is 60971 in binary?
1110111000101011 (hexadecimal EE2B, octal 167053).
What is the square root of 60971?
About 246.9231.
Is 60971 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 60971?
60971 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 19 × 3209, the product of two primes.