The number 10469
10469 is a composite number with 6 divisors. Its prime factorisation is Ć 29. Divisors (6): 1, 19, 29, 361, 551, 10469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10469 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10469 is composite. Its prime factorisation is
- 3
The divisors add up to 11430; without 10469 itself that is 961, so 10469 is deficient (961 is less than 10469). Euler's totient Ļ(10469) = 9576 numbers up to 10469 share no factor with it.
- 4
The digits of 10469 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10469 = 19^{2} \times 29 \]10469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 11430 |
| Euler totient Ļ(n) | 9576 |
| Square | 109599961 |
| Cube | 1147401991709 |
| Square root | 102.318131 (= 19ā29) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 86 |
| Scientific notation | 1.0469 Ć |
10469 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and sixty-nine |
| Binary (base 2) | 10100011100101 |
| Octal (base 8) | 24345 |
| Hexadecimal (base 16) | 28E5 |
| Base 3 | 112100202 |
| As time | 10469 seconds = 2 h 54 min 29 s |
Is 10469 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10469 a prime number?
No. 10469 = Ć 29, so it is divisible by 19.
What are the factors of 10469?
1, 19, 29, 361, 551, 10469.
What is 10469 in binary?
10100011100101 (hexadecimal 28E5, octal 24345).
What is the square root of 10469?
About 102.3181, exactly 19ā29.
Is 10469 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 10469?
It is a composite number with 6 divisors.