The number 15078
15078 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 7 × 359. Divisors (16): 1, 2, 3, 6, 7, 14, 21, 42, 359, 718, 1077, 2154, 2513, 5026, 7539, 15078.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15078: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.
- 2
15078 is composite. Its prime factorisation is
- 3
The divisors add up to 34560; without 15078 itself that is 19482, so 15078 is abundant (19482 is more than 15078). Euler's totient φ(15078) = 4296 numbers up to 15078 share no factor with it.
- 4
The digits of 15078 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15078 = 2 \times 3 \times 7 \times 359 \]
15078 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 34560 |
| Euler totient φ(n) | 4296 |
| Square | 227346084 |
| Cube | 3427924254552 |
| Square root | 122.792508 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.5078 × |
15078 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and seventy-eight |
| Binary (base 2) | 11101011100110 |
| Octal (base 8) | 35346 |
| Hexadecimal (base 16) | 3AE6 |
| Base 3 | 202200110 |
| As time | 15078 seconds = 4 h 11 min 18 s |
Is 15078 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15078 ÷ 2 = 7539) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15078 ÷ 3 = 5026) | 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 (15078 ÷ 6 = 2513) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15078 ÷ 7 = 2154) | 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 | 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 8) | 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 15078 a prime number?
No. 15078 = 2 × 3 × 7 × 359, so it is divisible by 2.
What are the factors of 15078?
1, 2, 3, 6, 7, 14, 21, 42, 359, 718, 1077, 2154, 2513, 5026, 7539, 15078.
What is 15078 in binary?
11101011100110 (hexadecimal 3AE6, octal 35346).
What is the square root of 15078?
About 122.7925.
Is 15078 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 15078?
15078 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 21.