The number 9469
9469 is a composite number with 4 divisors. Its prime factorisation is 17 × 557. Divisors (4): 1, 17, 557, 9469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9469: a semiprime: 17 × 557, the product of two primes.
- 2
9469 is composite. Its prime factorisation is
- 3
The divisors add up to 10044; without 9469 itself that is 575, so 9469 is deficient (575 is less than 9469). Euler's totient φ(9469) = 8896 numbers up to 9469 share no factor with it.
- 4
The digits of 9469 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9469 = 17 \times 557 \]
9469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 10044 |
| Euler totient φ(n) | 8896 |
| Square | 89661961 |
| Cube | 849009108709 |
| Square root | 97.308787 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 91 |
| Scientific notation | 9.469 × |
9469 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and sixty-nine |
| Binary (base 2) | 10010011111101 |
| Octal (base 8) | 22375 |
| Hexadecimal (base 16) | 24FD |
| Base 3 | 110222201 |
| As time | 9469 seconds = 2 h 37 min 49 s |
Is 9469 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 | No (remainder 1) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9469 a prime number?
No. 9469 = 17 × 557, so it is divisible by 17.
What are the factors of 9469?
1, 17, 557, 9469.
What is 9469 in binary?
10010011111101 (hexadecimal 24FD, octal 22375).
What is the square root of 9469?
About 97.3088.
Is 9469 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 9469?
9469 is a semiprime: 17 × 557, the product of two primes.