The number 8962
8962 is a composite number with 4 divisors. Its prime factorisation is 2 × 4481. Divisors (4): 1, 2, 4481, 8962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8962: a semiprime: 2 × 4481, the product of two primes.
- 2
8962 is composite. Its prime factorisation is
- 3
The divisors add up to 13446; without 8962 itself that is 4484, so 8962 is deficient (4484 is less than 8962). Euler's totient φ(8962) = 4480 numbers up to 8962 share no factor with it.
- 4
The digits of 8962 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8962 = 2 \times 4481 \]
8962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13446 |
| Euler totient φ(n) | 4480 |
| Square | 80317444 |
| Cube | 719804933128 |
| Square root | 94.667840 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 47 |
| Scientific notation | 8.962 × |
8962 in other forms
| Form | Value |
|---|---|
| In words | eight thousand nine hundred and sixty-two |
| Binary (base 2) | 10001100000010 |
| Octal (base 8) | 21402 |
| Hexadecimal (base 16) | 2302 |
| Base 3 | 110021221 |
| As time | 8962 seconds = 2 h 29 min 22 s |
Is 8962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (8962 ÷ 2 = 4481) | 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 | 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 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | No (remainder 7) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8962 a prime number?
No. 8962 = 2 × 4481, so it is divisible by 2.
What are the factors of 8962?
1, 2, 4481, 8962.
What is 8962 in binary?
10001100000010 (hexadecimal 2302, octal 21402).
What is the square root of 8962?
About 94.6678.
Is 8962 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 8962?
8962 is a semiprime: 2 × 4481, the product of two primes.