The number 41663
41663 is a composite number with 4 divisors. Its prime factorisation is 61 × 683. Divisors (4): 1, 61, 683, 41663.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41663: a semiprime: 61 × 683, the product of two primes.
- 2
41663 is composite. Its prime factorisation is
- 3
The divisors add up to 42408; without 41663 itself that is 745, so 41663 is deficient (745 is less than 41663). Euler's totient φ(41663) = 40920 numbers up to 41663 share no factor with it.
- 4
The digits of 41663 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 181 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41663 = 61 \times 683 \]
41663 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42408 |
| Euler totient φ(n) | 40920 |
| Square | 1735805569 |
| Cube | 72318867421247 |
| Square root | 204.115164 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 181 |
| Scientific notation | 4.1663 × |
41663 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand six hundred and sixty-three |
| Binary (base 2) | 1010001010111111 |
| Octal (base 8) | 121277 |
| Hexadecimal (base 16) | A2BF |
| Base 3 | 2010011002 |
| As time | 41663 seconds = 11 h 34 min 23 s |
Is 41663 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 6) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 6) | 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 41663 a prime number?
No. 41663 = 61 × 683, so it is divisible by 61.
What are the factors of 41663?
1, 61, 683, 41663.
What is 41663 in binary?
1010001010111111 (hexadecimal A2BF, octal 121277).
What is the square root of 41663?
About 204.1152.
Is 41663 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 41663?
41663 is a semiprime: 61 × 683, the product of two primes.