The number 9462
9462 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 19 × 83. Divisors (16): 1, 2, 3, 6, 19, 38, 57, 83, 114, 166, 249, 498, 1577, 3154, 4731, 9462.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9462 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9462 is composite. Its prime factorisation is
- 3
The divisors add up to 20160; without 9462 itself that is 10698, so 9462 is abundant (10698 is more than 9462). Euler's totient φ(9462) = 2952 numbers up to 9462 share no factor with it.
- 4
The digits of 9462 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9462 = 2 \times 3 \times 19 \times 83 \]
9462 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 20160 |
| Euler totient φ(n) | 2952 |
| Square | 89529444 |
| Cube | 847127599128 |
| Square root | 97.272812 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.462 × |
9462 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and sixty-two |
| Binary (base 2) | 10010011110110 |
| Octal (base 8) | 22366 |
| Hexadecimal (base 16) | 24F6 |
| Base 3 | 110222110 |
| As time | 9462 seconds = 2 h 37 min 42 s |
Is 9462 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9462 ÷ 2 = 4731) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9462 ÷ 3 = 3154) | 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 (9462 ÷ 6 = 1577) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 2) | 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 9462 a prime number?
No. 9462 = 2 × 3 × 19 × 83, so it is divisible by 2.
What are the factors of 9462?
1, 2, 3, 6, 19, 38, 57, 83, 114, 166, 249, 498, 1577, 3154, 4731, 9462.
What is 9462 in binary?
10010011110110 (hexadecimal 24F6, octal 22366).
What is the square root of 9462?
About 97.2728.
Is 9462 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9462?
It is a composite number with 16 divisors.