The number 14562
14562 is a composite number with 12 divisors. Its prime factorisation is 2 × × 809. Divisors (12): 1, 2, 3, 6, 9, 18, 809, 1618, 2427, 4854, 7281, 14562.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14562: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
14562 is composite. Its prime factorisation is
- 3
The divisors add up to 31590; without 14562 itself that is 17028, so 14562 is abundant (17028 is more than 14562). Euler's totient φ(14562) = 4848 numbers up to 14562 share no factor with it.
- 4
The digits of 14562 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 19 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14562 = 2 \times 3^{2} \times 809 \]14562 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 31590 |
| Euler totient φ(n) | 4848 |
| Square | 212051844 |
| Cube | 3087898952328 |
| Square root | 120.673112 (= 3√1618) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 19 |
| Scientific notation | 1.4562 × |
14562 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and sixty-two |
| Binary (base 2) | 11100011100010 |
| Octal (base 8) | 34342 |
| Hexadecimal (base 16) | 38E2 |
| Base 3 | 201222100 |
| As time | 14562 seconds = 4 h 2 min 42 s |
Is 14562 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14562 ÷ 2 = 7281) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14562 ÷ 3 = 4854) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14562 ÷ 6 = 2427) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (14562 ÷ 9 = 1618) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14562 a prime number?
No. 14562 = 2 × × 809, so it is divisible by 2.
What are the factors of 14562?
1, 2, 3, 6, 9, 18, 809, 1618, 2427, 4854, 7281, 14562.
What is 14562 in binary?
11100011100010 (hexadecimal 38E2, octal 34342).
What is the square root of 14562?
About 120.6731, exactly 3√1618.
Is 14562 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 14562?
14562 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.