The number 60951
60951 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1847. Divisors (8): 1, 3, 11, 33, 1847, 5541, 20317, 60951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60951 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60951 is composite. Its prime factorisation is
- 3
The divisors add up to 88704; without 60951 itself that is 27753, so 60951 is deficient (27753 is less than 60951). Euler's totient φ(60951) = 36920 numbers up to 60951 share no factor with it.
- 4
The digits of 60951 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60951 = 3 \times 11 \times 1847 \]
60951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88704 |
| Euler totient φ(n) | 36920 |
| Square | 3715024401 |
| Cube | 226434452265351 |
| Square root | 246.882563 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.0951 × |
60951 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand nine hundred and fifty-one |
| Binary (base 2) | 1110111000010111 |
| Octal (base 8) | 167027 |
| Hexadecimal (base 16) | EE17 |
| Base 3 | 10002121110 |
| As time | 60951 seconds = 16 h 55 min 51 s |
Is 60951 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 (60951 ÷ 3 = 20317) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 | Yes (60951 ÷ 11 = 5541) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60951 a prime number?
No. 60951 = 3 × 11 × 1847, so it is divisible by 3.
What are the factors of 60951?
1, 3, 11, 33, 1847, 5541, 20317, 60951.
What is 60951 in binary?
1110111000010111 (hexadecimal EE17, octal 167027).
What is the square root of 60951?
About 246.8826.
Is 60951 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 60951?
It is a composite number with 8 divisors.