The number 12563
12563 is a composite number with 4 divisors. Its prime factorisation is 17 × 739. Divisors (4): 1, 17, 739, 12563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12563: a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 739, the product of two primes.
- 2
12563 is composite. Its prime factorisation is
- 3
The divisors add up to 13320; without 12563 itself that is 757, so 12563 is deficient (757 is less than 12563). Euler's totient φ(12563) = 11808 numbers up to 12563 share no factor with it.
- 4
The digits of 12563 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12563 = 17 \times 739 \]
12563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13320 |
| Euler totient φ(n) | 11808 |
| Square | 157828969 |
| Cube | 1982805337547 |
| Square root | 112.084789 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2563 × |
12563 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and sixty-three |
| Binary (base 2) | 11000100010011 |
| Octal (base 8) | 30423 |
| Hexadecimal (base 16) | 3113 |
| Base 3 | 122020022 |
| As time | 12563 seconds = 3 h 29 min 23 s |
Is 12563 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12563 a prime number?
No. 12563 = 17 × 739, so it is divisible by 17.
What are the factors of 12563?
1, 17, 739, 12563.
What is 12563 in binary?
11000100010011 (hexadecimal 3113, octal 30423).
What is the square root of 12563?
About 112.0848.
Is 12563 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 12563?
12563 is a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 739, the product of two primes.