The number 8469
8469 is a composite number with 6 divisors. Its prime factorisation is × 941. Divisors (6): 1, 3, 9, 941, 2823, 8469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
8469 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
8469 is composite. Its prime factorisation is
- 3
The divisors add up to 12246; without 8469 itself that is 3777, so 8469 is deficient (3777 is less than 8469). Euler's totient φ(8469) = 5640 numbers up to 8469 share no factor with it.
- 4
The digits of 8469 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 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8469 = 3^{2} \times 941 \]8469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 12246 |
| Euler totient φ(n) | 5640 |
| Square | 71723961 |
| Cube | 607430225709 |
| Square root | 92.027170 (= 3√941) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 34 |
| Scientific notation | 8.469 × |
8469 in other forms
| Form | Value |
|---|---|
| In words | eight thousand four hundred and sixty-nine |
| Binary (base 2) | 10000100010101 |
| Octal (base 8) | 20425 |
| Hexadecimal (base 16) | 2115 |
| Base 3 | 102121200 |
| As time | 8469 seconds = 2 h 21 min 9 s |
Is 8469 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 (8469 ÷ 3 = 2823) | 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 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 (8469 ÷ 9 = 941) | 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 10) | 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 8469 a prime number?
No. 8469 = × 941, so it is divisible by 3.
What are the factors of 8469?
1, 3, 9, 941, 2823, 8469.
What is 8469 in binary?
10000100010101 (hexadecimal 2115, octal 20425).
What is the square root of 8469?
About 92.0272, exactly 3√941.
Is 8469 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 8469?
It is a composite number with 6 divisors.