The number 8952
8952 is a composite number with 16 divisors. Its prime factorisation is × 3 × 373. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 373, 746, 1119, 1492, 2238, 2984, 4476, 8952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8952: a Harshad number: divisible by its digit sum 24.
- 2
8952 is composite. Its prime factorisation is
- 3
The divisors add up to 22440; without 8952 itself that is 13488, so 8952 is abundant (13488 is more than 8952). Euler's totient φ(8952) = 2976 numbers up to 8952 share no factor with it.
- 4
The digits of 8952 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8952 = 2^{3} \times 3 \times 373 \]8952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 22440 |
| Euler totient φ(n) | 2976 |
| Square | 80138304 |
| Cube | 717398097408 |
| Square root | 94.615009 (= 2√2238) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 8.952 × |
8952 in other forms
| Form | Value |
|---|---|
| In words | eight thousand nine hundred and fifty-two |
| Binary (base 2) | 10001011111000 |
| Octal (base 8) | 21370 |
| Hexadecimal (base 16) | 22F8 |
| Base 3 | 110021120 |
| As time | 8952 seconds = 2 h 29 min 12 s |
Is 8952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (8952 ÷ 2 = 4476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (8952 ÷ 3 = 2984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (8952 ÷ 4 = 2238) | 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 | Yes (8952 ÷ 6 = 1492) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (8952 ÷ 8 = 1119) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (8952 ÷ 12 = 746) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8952 a prime number?
No. 8952 = × 3 × 373, so it is divisible by 2.
What are the factors of 8952?
1, 2, 3, 4, 6, 8, 12, 24, 373, 746, 1119, 1492, 2238, 2984, 4476, 8952.
What is 8952 in binary?
10001011111000 (hexadecimal 22F8, octal 21370).
What is the square root of 8952?
About 94.6150, exactly 2√2238.
Is 8952 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 8952?
8952 is a Harshad number: divisible by its digit sum 24.