The number 42563
42563 is a composite number with 4 divisors. Its prime factorisation is 31 × 1373. Divisors (4): 1, 31, 1373, 42563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 42563: a semiprime: 31 × 1373, the product of two primes.
- 2
42563 is composite. Its prime factorisation is
- 3
The divisors add up to 43968; without 42563 itself that is 1405, so 42563 is deficient (1405 is less than 42563). Euler's totient φ(42563) = 41160 numbers up to 42563 share no factor with it.
- 4
The digits of 42563 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 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42563 = 31 \times 1373 \]
42563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 43968 |
| Euler totient φ(n) | 41160 |
| Square | 1811608969 |
| Cube | 77107512547547 |
| Square root | 206.308022 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.2563 × |
42563 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand five hundred and sixty-three |
| Binary (base 2) | 1010011001000011 |
| Octal (base 8) | 123103 |
| Hexadecimal (base 16) | A643 |
| Base 3 | 2011101102 |
| As time | 42563 seconds = 11 h 49 min 23 s |
Is 42563 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 3) | 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 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 4) | 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 42563 a prime number?
No. 42563 = 31 × 1373, so it is divisible by 31.
What are the factors of 42563?
1, 31, 1373, 42563.
What is 42563 in binary?
1010011001000011 (hexadecimal A643, octal 123103).
What is the square root of 42563?
About 206.3080.
Is 42563 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 42563?
42563 is a semiprime: 31 × 1373, the product of two primes.