The number 15678
15678 is a composite number with 24 divisors. Its prime factorisation is 2 × × 13 × 67. Divisors (24): 1, 2, 3, 6, 9, 13, 18, 26, 39, 67, 78, 117, 134, 201, 234, 402 … 15678.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15678 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15678 is composite. Its prime factorisation is
- 3
The divisors add up to 37128; without 15678 itself that is 21450, so 15678 is abundant (21450 is more than 15678). Euler's totient φ(15678) = 4752 numbers up to 15678 share no factor with it.
- 4
The digits of 15678 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15678 = 2 \times 3^{2} \times 13 \times 67 \]15678 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 37128 |
| Euler totient φ(n) | 4752 |
| Square | 245799684 |
| Cube | 3853647445752 |
| Square root | 125.211821 (= 3√1742) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5678 × |
15678 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand six hundred and seventy-eight |
| Binary (base 2) | 11110100111110 |
| Octal (base 8) | 36476 |
| Hexadecimal (base 16) | 3D3E |
| Base 3 | 210111200 |
| As time | 15678 seconds = 4 h 21 min 18 s |
Is 15678 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15678 ÷ 2 = 7839) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15678 ÷ 3 = 5226) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15678 ÷ 6 = 2613) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (15678 ÷ 9 = 1742) | 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 3) | 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 15678 a prime number?
No. 15678 = 2 × × 13 × 67, so it is divisible by 2.
What are the factors of 15678?
1, 2, 3, 6, 9, 13, 18, 26, 39, 67, 78, 117, 134, 201, 234, 402, 603, 871, 1206, 1742, 2613, 5226, 7839, 15678.
What is 15678 in binary?
11110100111110 (hexadecimal 3D3E, octal 36476).
What is the square root of 15678?
About 125.2118, exactly 3√1742.
Is 15678 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 15678?
It is a composite number with 24 divisors.