The number 10563
10563 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 503. Divisors (8): 1, 3, 7, 21, 503, 1509, 3521, 10563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10563 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10563 is composite. Its prime factorisation is
- 3
The divisors add up to 16128; without 10563 itself that is 5565, so 10563 is deficient (5565 is less than 10563). Euler's totient φ(10563) = 6024 numbers up to 10563 share no factor with it.
- 4
The digits of 10563 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10563 = 3 \times 7 \times 503 \]
10563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 16128 |
| Euler totient φ(n) | 6024 |
| Square | 111576969 |
| Cube | 1178587523547 |
| Square root | 102.776456 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.0563 × |
10563 in other forms
| Form | Value |
|---|---|
| In words | ten thousand five hundred and sixty-three |
| Binary (base 2) | 10100101000011 |
| Octal (base 8) | 24503 |
| Hexadecimal (base 16) | 2943 |
| Base 3 | 112111020 |
| As time | 10563 seconds = 2 h 56 min 3 s |
Is 10563 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 (10563 ÷ 3 = 3521) | 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 | Yes (10563 ÷ 7 = 1509) | 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 3) | 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 10563 a prime number?
No. 10563 = 3 × 7 × 503, so it is divisible by 3.
What are the factors of 10563?
1, 3, 7, 21, 503, 1509, 3521, 10563.
What is 10563 in binary?
10100101000011 (hexadecimal 2943, octal 24503).
What is the square root of 10563?
About 102.7765.
Is 10563 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 10563?
It is a composite number with 8 divisors.