The number 9477
9477 is a composite number with 14 divisors. Its prime factorisation is × 13. Divisors (14): 1, 3, 9, 13, 27, 39, 81, 117, 243, 351, 729, 1053, 3159, 9477.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9477: a Harshad number: divisible by its digit sum 27.
- 2
9477 is composite. Its prime factorisation is
- 3
The divisors add up to 15302; without 9477 itself that is 5825, so 9477 is deficient (5825 is less than 9477). Euler's totient φ(9477) = 5832 numbers up to 9477 share no factor with it.
- 4
The digits of 9477 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9477 = 3^{6} \times 13 \]9477 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 15302 |
| Euler totient φ(n) | 5832 |
| Square | 89813529 |
| Cube | 851162814333 |
| Square root | 97.349884 (= 27√13) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 122 |
| Scientific notation | 9.477 × |
9477 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and seventy-seven |
| Binary (base 2) | 10010100000101 |
| Octal (base 8) | 22405 |
| Hexadecimal (base 16) | 2505 |
| Base 3 | 111000000 |
| As time | 9477 seconds = 2 h 37 min 57 s |
Is 9477 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 (9477 ÷ 3 = 3159) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (9477 ÷ 9 = 1053) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9477 a prime number?
No. 9477 = × 13, so it is divisible by 3.
What are the factors of 9477?
1, 3, 9, 13, 27, 39, 81, 117, 243, 351, 729, 1053, 3159, 9477.
What is 9477 in binary?
10010100000101 (hexadecimal 2505, octal 22405).
What is the square root of 9477?
About 97.3499, exactly 27√13.
Is 9477 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 9477?
9477 is a Harshad number: divisible by its digit sum 27.