The number 42562
42562 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 1637. Divisors (8): 1, 2, 13, 26, 1637, 3274, 21281, 42562.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
42562 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
42562 is composite. Its prime factorisation is
- 3
The divisors add up to 68796; without 42562 itself that is 26234, so 42562 is deficient (26234 is less than 42562). Euler's totient φ(42562) = 19632 numbers up to 42562 share no factor with it.
- 4
The digits of 42562 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 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 42562 = 2 \times 13 \times 1637 \]
42562 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68796 |
| Euler totient φ(n) | 19632 |
| Square | 1811523844 |
| Cube | 77102077848328 |
| Square root | 206.305599 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 101 |
| Scientific notation | 4.2562 × |
42562 in other forms
| Form | Value |
|---|---|
| In words | forty-two thousand five hundred and sixty-two |
| Binary (base 2) | 1010011001000010 |
| Octal (base 8) | 123102 |
| Hexadecimal (base 16) | A642 |
| Base 3 | 2011101101 |
| As time | 42562 seconds = 11 h 49 min 22 s |
Is 42562 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (42562 ÷ 2 = 21281) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | 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 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 42562 a prime number?
No. 42562 = 2 × 13 × 1637, so it is divisible by 2.
What are the factors of 42562?
1, 2, 13, 26, 1637, 3274, 21281, 42562.
What is 42562 in binary?
1010011001000010 (hexadecimal A642, octal 123102).
What is the square root of 42562?
About 206.3056.
Is 42562 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 42562?
It is a composite number with 8 divisors.