The number 66952
66952 is a composite number with 8 divisors. Its prime factorisation is × 8369. Divisors (8): 1, 2, 4, 8, 8369, 16738, 33476, 66952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
66952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
66952 is composite. Its prime factorisation is
- 3
The divisors add up to 125550; without 66952 itself that is 58598, so 66952 is deficient (58598 is less than 66952). Euler's totient φ(66952) = 33472 numbers up to 66952 share no factor with it.
- 4
The digits of 66952 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 66952 = 2^{3} \times 8369 \]66952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 125550 |
| Euler totient φ(n) | 33472 |
| Square | 4482570304 |
| Cube | 300117046993408 |
| Square root | 258.750845 (= 2√16738) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 42 |
| Scientific notation | 6.6952 × |
66952 in other forms
| Form | Value |
|---|---|
| In words | sixty-six thousand nine hundred and fifty-two |
| Binary (base 2) | 10000010110001000 |
| Octal (base 8) | 202610 |
| Hexadecimal (base 16) | 10588 |
| Base 3 | 10101211201 |
| As time | 66952 seconds = 18 h 35 min 52 s |
Is 66952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (66952 ÷ 2 = 33476) | 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 (66952 ÷ 4 = 16738) | 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 4) | 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 (66952 ÷ 8 = 8369) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 6) | 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 66952 a prime number?
No. 66952 = × 8369, so it is divisible by 2.
What are the factors of 66952?
1, 2, 4, 8, 8369, 16738, 33476, 66952.
What is 66952 in binary?
10000010110001000 (hexadecimal 10588, octal 202610).
What is the square root of 66952?
About 258.7508, exactly 2√16738.
Is 66952 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 66952?
It is a composite number with 8 divisors.