The number 15978
15978 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 2663. Divisors (8): 1, 2, 3, 6, 2663, 5326, 7989, 15978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15978 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15978 is composite. Its prime factorisation is
- 3
The divisors add up to 31968; without 15978 itself that is 15990, so 15978 is abundant (15990 is more than 15978). Euler's totient φ(15978) = 5324 numbers up to 15978 share no factor with it.
- 4
The digits of 15978 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15978 = 2 \times 3 \times 2663 \]
15978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 31968 |
| Euler totient φ(n) | 5324 |
| Square | 255296484 |
| Cube | 4079127221352 |
| Square root | 126.404114 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 53 |
| Scientific notation | 1.5978 × |
15978 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand nine hundred and seventy-eight |
| Binary (base 2) | 11111001101010 |
| Octal (base 8) | 37152 |
| Hexadecimal (base 16) | 3E6A |
| Base 3 | 210220210 |
| As time | 15978 seconds = 4 h 26 min 18 s |
Is 15978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15978 ÷ 2 = 7989) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15978 ÷ 3 = 5326) | 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 (15978 ÷ 6 = 2663) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | No (remainder 3) | 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 6) | 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 15978 a prime number?
No. 15978 = 2 × 3 × 2663, so it is divisible by 2.
What are the factors of 15978?
1, 2, 3, 6, 2663, 5326, 7989, 15978.
What is 15978 in binary?
11111001101010 (hexadecimal 3E6A, octal 37152).
What is the square root of 15978?
About 126.4041.
Is 15978 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 15978?
It is a composite number with 8 divisors.