The number 1563
1563 is a composite number with 4 divisors. Its prime factorisation is 3 × 521. Divisors (4): 1, 3, 521, 1563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1563: a semiprime: 3 × 521, the product of two primes.
- 2
1563 is composite. Its prime factorisation is
- 3
The divisors add up to 2088; without 1563 itself that is 525, so 1563 is deficient (525 is less than 1563). Euler's totient φ(1563) = 1040 numbers up to 1563 share no factor with it.
- 4
The digits of 1563 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1563 = 3 \times 521 \]
1563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2088 |
| Euler totient φ(n) | 1040 |
| Square | 2442969 |
| Cube | 3818360547 |
| Square root | 39.534795 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 153 |
| Scientific notation | 1.563 × |
1563 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and sixty-three |
| Roman numerals | MDLXIII |
| Binary (base 2) | 11000011011 |
| Octal (base 8) | 3033 |
| Hexadecimal (base 16) | 61B |
| Base 3 | 2010220 |
| As time | 1563 seconds = 26 min 3 s |
Is 1563 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1563 ÷ 3 = 521) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1563 a prime number?
No. 1563 = 3 × 521, so it is divisible by 3.
What are the factors of 1563?
1, 3, 521, 1563.
What is 1563 in binary?
11000011011 (hexadecimal 61B, octal 3033).
What is the square root of 1563?
About 39.5348.
What is 1563 in Roman numerals?
MDLXIII.
Is 1563 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1563?
1563 is a semiprime: 3 × 521, the product of two primes.