The number 9466
9466 is a composite number with 4 divisors. Its prime factorisation is 2 × 4733. Divisors (4): 1, 2, 4733, 9466.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9466: a semiprime: 2 × 4733, the product of two primes.
- 2
9466 is composite. Its prime factorisation is
- 3
The divisors add up to 14202; without 9466 itself that is 4736, so 9466 is deficient (4736 is less than 9466). Euler's totient φ(9466) = 4732 numbers up to 9466 share no factor with it.
- 4
The digits of 9466 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9466 = 2 \times 4733 \]
9466 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14202 |
| Euler totient φ(n) | 4732 |
| Square | 89605156 |
| Cube | 848202406696 |
| Square root | 97.293371 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 91 |
| Scientific notation | 9.466 × |
9466 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and sixty-six |
| Binary (base 2) | 10010011111010 |
| Octal (base 8) | 22372 |
| Hexadecimal (base 16) | 24FA |
| Base 3 | 110222121 |
| As time | 9466 seconds = 2 h 37 min 46 s |
Is 9466 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9466 ÷ 2 = 4733) | 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 1) | 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 6) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9466 a prime number?
No. 9466 = 2 × 4733, so it is divisible by 2.
What are the factors of 9466?
1, 2, 4733, 9466.
What is 9466 in binary?
10010011111010 (hexadecimal 24FA, octal 22372).
What is the square root of 9466?
About 97.2934.
Is 9466 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 9466?
9466 is a semiprime: 2 × 4733, the product of two primes.