The number 10952
10952 is a composite number with 12 divisors. Its prime factorisation is × . Divisors (12): 1, 2, 4, 8, 37, 74, 148, 296, 1369, 2738, 5476, 10952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10952 is composite. Its prime factorisation is
- 3
The divisors add up to 21105; without 10952 itself that is 10153, so 10952 is deficient (10153 is less than 10952). Euler's totient φ(10952) = 5328 numbers up to 10952 share no factor with it.
- 4
The digits of 10952 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10952 = 2^{3} \times 37^{2} \]10952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 21105 |
| Euler totient φ(n) | 5328 |
| Square | 119946304 |
| Cube | 1313651921408 |
| Square root | 104.651804 (= 74√2) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.0952 × |
10952 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and fifty-two |
| Binary (base 2) | 10101011001000 |
| Octal (base 8) | 25310 |
| Hexadecimal (base 16) | 2AC8 |
| Base 3 | 120000122 |
| As time | 10952 seconds = 3 h 2 min 32 s |
Is 10952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10952 ÷ 2 = 5476) | 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 | Yes (10952 ÷ 4 = 2738) | 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 2) | 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 (10952 ÷ 8 = 1369) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10952 a prime number?
No. 10952 = × , so it is divisible by 2.
What are the factors of 10952?
1, 2, 4, 8, 37, 74, 148, 296, 1369, 2738, 5476, 10952.
What is 10952 in binary?
10101011001000 (hexadecimal 2AC8, octal 25310).
What is the square root of 10952?
About 104.6518, exactly 74√2.
Is 10952 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 10952?
It is a composite number with 12 divisors.