The number 14568
14568 is a composite number with 16 divisors. Its prime factorisation is × 3 × 607. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 607, 1214, 1821, 2428, 3642, 4856, 7284, 14568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14568: a Harshad number: divisible by its digit sum 24.
- 2
14568 is composite. Its prime factorisation is
- 3
The divisors add up to 36480; without 14568 itself that is 21912, so 14568 is abundant (21912 is more than 14568). Euler's totient φ(14568) = 4848 numbers up to 14568 share no factor with it.
- 4
The digits of 14568 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 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14568 = 2^{3} \times 3 \times 607 \]14568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 36480 |
| Euler totient φ(n) | 4848 |
| Square | 212226624 |
| Cube | 3091717458432 |
| Square root | 120.697970 (= 2√3642) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.4568 × |
14568 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand five hundred and sixty-eight |
| Binary (base 2) | 11100011101000 |
| Octal (base 8) | 34350 |
| Hexadecimal (base 16) | 38E8 |
| Base 3 | 201222120 |
| As time | 14568 seconds = 4 h 2 min 48 s |
Is 14568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14568 ÷ 2 = 7284) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14568 ÷ 3 = 4856) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14568 ÷ 4 = 3642) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (14568 ÷ 6 = 2428) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (14568 ÷ 8 = 1821) | 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 8) | 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 | Yes (14568 ÷ 12 = 1214) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14568 a prime number?
No. 14568 = × 3 × 607, so it is divisible by 2.
What are the factors of 14568?
1, 2, 3, 4, 6, 8, 12, 24, 607, 1214, 1821, 2428, 3642, 4856, 7284, 14568.
What is 14568 in binary?
11100011101000 (hexadecimal 38E8, octal 34350).
What is the square root of 14568?
About 120.6980, exactly 2√3642.
Is 14568 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 14568?
14568 is a Harshad number: divisible by its digit sum 24.