The number 1578
1578 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 263. Divisors (8): 1, 2, 3, 6, 263, 526, 789, 1578.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1578: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
1578 is composite. Its prime factorisation is
- 3
The divisors add up to 3168; without 1578 itself that is 1590, so 1578 is abundant (1590 is more than 1578). Euler's totient φ(1578) = 524 numbers up to 1578 share no factor with it.
- 4
The digits of 1578 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 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1578 = 2 \times 3 \times 263 \]
1578 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 3168 |
| Euler totient φ(n) | 524 |
| Square | 2490084 |
| Cube | 3929352552 |
| Square root | 39.724048 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.578 × |
1578 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and seventy-eight |
| Roman numerals | MDLXXVIII |
| Binary (base 2) | 11000101010 |
| Octal (base 8) | 3052 |
| Hexadecimal (base 16) | 62A |
| Base 3 | 2011110 |
| As time | 1578 seconds = 26 min 18 s |
Is 1578 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1578 ÷ 2 = 789) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1578 ÷ 3 = 526) | 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 (1578 ÷ 6 = 263) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | 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 1578 a prime number?
No. 1578 = 2 × 3 × 263, so it is divisible by 2.
What are the factors of 1578?
1, 2, 3, 6, 263, 526, 789, 1578.
What is 1578 in binary?
11000101010 (hexadecimal 62A, octal 3052).
What is the square root of 1578?
About 39.7240.
What is 1578 in Roman numerals?
MDLXXVIII.
Is 1578 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 1578?
1578 is a happy number: repeatedly adding the squares of its digits reaches 1.