The number 60952
60952 is a composite number with 16 divisors. Its prime factorisation is × 19 × 401. Divisors (16): 1, 2, 4, 8, 19, 38, 76, 152, 401, 802, 1604, 3208, 7619, 15238, 30476, 60952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60952 is composite. Its prime factorisation is
- 3
The divisors add up to 120600; without 60952 itself that is 59648, so 60952 is deficient (59648 is less than 60952). Euler's totient φ(60952) = 28800 numbers up to 60952 share no factor with it.
- 4
The digits of 60952 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60952 = 2^{3} \times 19 \times 401 \]60952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 120600 |
| Euler totient φ(n) | 28800 |
| Square | 3715146304 |
| Cube | 226445597521408 |
| Square root | 246.884588 (= 2√15238) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 179 |
| Scientific notation | 6.0952 × |
60952 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand nine hundred and fifty-two |
| Binary (base 2) | 1110111000011000 |
| Octal (base 8) | 167030 |
| Hexadecimal (base 16) | EE18 |
| Base 3 | 10002121111 |
| As time | 60952 seconds = 16 h 55 min 52 s |
Is 60952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60952 ÷ 2 = 30476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (60952 ÷ 4 = 15238) | 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 4) | 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 | Yes (60952 ÷ 8 = 7619) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60952 a prime number?
No. 60952 = × 19 × 401, so it is divisible by 2.
What are the factors of 60952?
1, 2, 4, 8, 19, 38, 76, 152, 401, 802, 1604, 3208, 7619, 15238, 30476, 60952.
What is 60952 in binary?
1110111000011000 (hexadecimal EE18, octal 167030).
What is the square root of 60952?
About 246.8846, exactly 2√15238.
Is 60952 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 60952?
It is a composite number with 16 divisors.