The number 14465
14465 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 263. Divisors (8): 1, 5, 11, 55, 263, 1315, 2893, 14465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14465: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
14465 is composite. Its prime factorisation is
- 3
The divisors add up to 19008; without 14465 itself that is 4543, so 14465 is deficient (4543 is less than 14465). Euler's totient φ(14465) = 10480 numbers up to 14465 share no factor with it.
- 4
The digits of 14465 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 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14465 = 5 \times 11 \times 263 \]
14465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19008 |
| Euler totient φ(n) | 10480 |
| Square | 209236225 |
| Cube | 3026601994625 |
| Square root | 120.270528 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4465 × |
14465 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and sixty-five |
| Binary (base 2) | 11100010000001 |
| Octal (base 8) | 34201 |
| Hexadecimal (base 16) | 3881 |
| Base 3 | 201211202 |
| As time | 14465 seconds = 4 h 1 min 5 s |
Is 14465 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 | Yes (14465 ÷ 5 = 2893) | 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 3) | 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 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (14465 ÷ 11 = 1315) | 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 14465 a prime number?
No. 14465 = 5 × 11 × 263, so it is divisible by 5.
What are the factors of 14465?
1, 5, 11, 55, 263, 1315, 2893, 14465.
What is 14465 in binary?
11100010000001 (hexadecimal 3881, octal 34201).
What is the square root of 14465?
About 120.2705.
Is 14465 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 14465?
14465 is a happy number: repeatedly adding the squares of its digits reaches 1.