The number 14565
14565 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 971. Divisors (8): 1, 3, 5, 15, 971, 2913, 4855, 14565.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14565: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
14565 is composite. Its prime factorisation is
- 3
The divisors add up to 23328; without 14565 itself that is 8763, so 14565 is deficient (8763 is less than 14565). Euler's totient φ(14565) = 7760 numbers up to 14565 share no factor with it.
- 4
The digits of 14565 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 120 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14565 = 3 \times 5 \times 971 \]
14565 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 23328 |
| Euler totient φ(n) | 7760 |
| Square | 212139225 |
| Cube | 3089807812125 |
| Square root | 120.685542 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 120 |
| Scientific notation | 1.4565 × |
14565 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and sixty-five |
| Binary (base 2) | 11100011100101 |
| Octal (base 8) | 34345 |
| Hexadecimal (base 16) | 38E5 |
| Base 3 | 201222110 |
| As time | 14565 seconds = 4 h 2 min 45 s |
Is 14565 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 (14565 ÷ 3 = 4855) | 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 (14565 ÷ 5 = 2913) | 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 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 3) | 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 | No (remainder 1) | 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 14565 a prime number?
No. 14565 = 3 × 5 × 971, so it is divisible by 3.
What are the factors of 14565?
1, 3, 5, 15, 971, 2913, 4855, 14565.
What is 14565 in binary?
11100011100101 (hexadecimal 38E5, octal 34345).
What is the square root of 14565?
About 120.6855.
Is 14565 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14565?
14565 is a happy number: repeatedly adding the squares of its digits reaches 1.