The number 9476
9476 is a composite number with 12 divisors. Its prime factorisation is × 23 × 103. Divisors (12): 1, 2, 4, 23, 46, 92, 103, 206, 412, 2369, 4738, 9476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9476 is composite. Its prime factorisation is
- 3
The divisors add up to 17472; without 9476 itself that is 7996, so 9476 is deficient (7996 is less than 9476). Euler's totient φ(9476) = 4488 numbers up to 9476 share no factor with it.
- 4
The digits of 9476 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9476 = 2^{2} \times 23 \times 103 \]9476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 17472 |
| Euler totient φ(n) | 4488 |
| Square | 89794576 |
| Cube | 850893402176 |
| Square root | 97.344748 (= 2√2369) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 9.476 × |
9476 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and seventy-six |
| Binary (base 2) | 10010100000100 |
| Octal (base 8) | 22404 |
| Hexadecimal (base 16) | 2504 |
| Base 3 | 110222222 |
| As time | 9476 seconds = 2 h 37 min 56 s |
Is 9476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9476 ÷ 2 = 4738) | 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 (9476 ÷ 4 = 2369) | 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 2) | 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 4) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 9476 a prime number?
No. 9476 = × 23 × 103, so it is divisible by 2.
What are the factors of 9476?
1, 2, 4, 23, 46, 92, 103, 206, 412, 2369, 4738, 9476.
What is 9476 in binary?
10010100000100 (hexadecimal 2504, octal 22404).
What is the square root of 9476?
About 97.3447, exactly 2√2369.
Is 9476 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 9476?
It is a composite number with 12 divisors.