The number 9471
9471 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 11 × 41. Divisors (16): 1, 3, 7, 11, 21, 33, 41, 77, 123, 231, 287, 451, 861, 1353, 3157, 9471.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9471: a Harshad number: divisible by its digit sum 21.
- 2
9471 is composite. Its prime factorisation is
- 3
The divisors add up to 16128; without 9471 itself that is 6657, so 9471 is deficient (6657 is less than 9471). Euler's totient φ(9471) = 4800 numbers up to 9471 share no factor with it.
- 4
The digits of 9471 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9471 = 3 \times 7 \times 11 \times 41 \]
9471 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 16128 |
| Euler totient φ(n) | 4800 |
| Square | 89699841 |
| Cube | 849547194111 |
| Square root | 97.319063 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 9.471 × |
9471 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and seventy-one |
| Binary (base 2) | 10010011111111 |
| Octal (base 8) | 22377 |
| Hexadecimal (base 16) | 24FF |
| Base 3 | 110222210 |
| As time | 9471 seconds = 2 h 37 min 51 s |
Is 9471 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9471 ÷ 3 = 3157) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (9471 ÷ 7 = 1353) | 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 7) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (9471 ÷ 11 = 861) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9471 a prime number?
No. 9471 = 3 × 7 × 11 × 41, so it is divisible by 3.
What are the factors of 9471?
1, 3, 7, 11, 21, 33, 41, 77, 123, 231, 287, 451, 861, 1353, 3157, 9471.
What is 9471 in binary?
10010011111111 (hexadecimal 24FF, octal 22377).
What is the square root of 9471?
About 97.3191.
Is 9471 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9471?
9471 is a Harshad number: divisible by its digit sum 21.