The number 41563
41563 is a composite number with 4 divisors. Its prime factorisation is 89 × 467. Divisors (4): 1, 89, 467, 41563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41563: a semiprime: 89 × 467, the product of two primes.
- 2
41563 is composite. Its prime factorisation is
- 3
The divisors add up to 42120; without 41563 itself that is 557, so 41563 is deficient (557 is less than 41563). Euler's totient φ(41563) = 41008 numbers up to 41563 share no factor with it.
- 4
The digits of 41563 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41563 = 89 \times 467 \]
41563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42120 |
| Euler totient φ(n) | 41008 |
| Square | 1727482969 |
| Cube | 71799374640547 |
| Square root | 203.870057 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.1563 × |
41563 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand five hundred and sixty-three |
| Binary (base 2) | 1010001001011011 |
| Octal (base 8) | 121133 |
| Hexadecimal (base 16) | A25B |
| Base 3 | 2010000101 |
| As time | 41563 seconds = 11 h 32 min 43 s |
Is 41563 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 1) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 41563 a prime number?
No. 41563 = 89 × 467, so it is divisible by 89.
What are the factors of 41563?
1, 89, 467, 41563.
What is 41563 in binary?
1010001001011011 (hexadecimal A25B, octal 121133).
What is the square root of 41563?
About 203.8701.
Is 41563 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 41563?
41563 is a semiprime: 89 × 467, the product of two primes.