The number 10962
10962 is a composite number with 32 divisors. Its prime factorisation is 2 × × 7 × 29. Divisors (32): 1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 29, 42, 54, 58, 63, 87 … 10962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10962: a Harshad number: divisible by its digit sum 18.
- 2
10962 is composite. Its prime factorisation is
- 3
The divisors add up to 28800; without 10962 itself that is 17838, so 10962 is abundant (17838 is more than 10962). Euler's totient φ(10962) = 3024 numbers up to 10962 share no factor with it.
- 4
The digits of 10962 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10962 = 2 \times 3^{3} \times 7 \times 29 \]10962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 28800 |
| Euler totient φ(n) | 3024 |
| Square | 120165444 |
| Cube | 1317253597128 |
| Square root | 104.699570 (= 3√1218) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 42 |
| Scientific notation | 1.0962 × |
10962 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and sixty-two |
| Binary (base 2) | 10101011010010 |
| Octal (base 8) | 25322 |
| Hexadecimal (base 16) | 2AD2 |
| Base 3 | 120001000 |
| As time | 10962 seconds = 3 h 2 min 42 s |
Is 10962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10962 ÷ 2 = 5481) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10962 ÷ 3 = 3654) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 (10962 ÷ 6 = 1827) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (10962 ÷ 7 = 1566) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (10962 ÷ 9 = 1218) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10962 a prime number?
No. 10962 = 2 × × 7 × 29, so it is divisible by 2.
What are the factors of 10962?
1, 2, 3, 6, 7, 9, 14, 18, 21, 27, 29, 42, 54, 58, 63, 87, 126, 174, 189, 203, 261, 378, 406, 522, 609, 783, 1218, 1566, 1827, 3654, 5481, 10962.
What is 10962 in binary?
10101011010010 (hexadecimal 2AD2, octal 25322).
What is the square root of 10962?
About 104.6996, exactly 3√1218.
Is 10962 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 10962?
10962 is a Harshad number: divisible by its digit sum 18.