The number 14469
14469 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 13 × 53. Divisors (16): 1, 3, 7, 13, 21, 39, 53, 91, 159, 273, 371, 689, 1113, 2067, 4823, 14469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14469 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14469 is composite. Its prime factorisation is
- 3
The divisors add up to 24192; without 14469 itself that is 9723, so 14469 is deficient (9723 is less than 14469). Euler's totient φ(14469) = 7488 numbers up to 14469 share no factor with it.
- 4
The digits of 14469 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14469 = 3 \times 7 \times 13 \times 53 \]
14469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 24192 |
| Euler totient φ(n) | 7488 |
| Square | 209351961 |
| Cube | 3029113523709 |
| Square root | 120.287156 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4469 × |
14469 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and sixty-nine |
| Binary (base 2) | 11100010000101 |
| Octal (base 8) | 34205 |
| Hexadecimal (base 16) | 3885 |
| Base 3 | 201211220 |
| As time | 14469 seconds = 4 h 1 min 9 s |
Is 14469 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 (14469 ÷ 3 = 4823) | 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 | Yes (14469 ÷ 7 = 2067) | 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 6) | 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 4) | 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 14469 a prime number?
No. 14469 = 3 × 7 × 13 × 53, so it is divisible by 3.
What are the factors of 14469?
1, 3, 7, 13, 21, 39, 53, 91, 159, 273, 371, 689, 1113, 2067, 4823, 14469.
What is 14469 in binary?
11100010000101 (hexadecimal 3885, octal 34205).
What is the square root of 14469?
About 120.2872.
Is 14469 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 14469?
It is a composite number with 16 divisors.