The number 40562
40562 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 1193. Divisors (8): 1, 2, 17, 34, 1193, 2386, 20281, 40562.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40562: a Harshad number: divisible by its digit sum 17.
- 2
40562 is composite. Its prime factorisation is
- 3
The divisors add up to 64476; without 40562 itself that is 23914, so 40562 is deficient (23914 is less than 40562). Euler's totient φ(40562) = 19072 numbers up to 40562 share no factor with it.
- 4
The digits of 40562 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 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40562 = 2 \times 17 \times 1193 \]
40562 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 64476 |
| Euler totient φ(n) | 19072 |
| Square | 1645275844 |
| Cube | 66735678784328 |
| Square root | 201.400099 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.0562 × |
40562 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and sixty-two |
| Binary (base 2) | 1001111001110010 |
| Octal (base 8) | 117162 |
| Hexadecimal (base 16) | 9E72 |
| Base 3 | 2001122022 |
| As time | 40562 seconds = 11 h 16 min 2 s |
Is 40562 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (40562 ÷ 2 = 20281) | 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 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 2) | 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 2) | 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 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 40562 a prime number?
No. 40562 = 2 × 17 × 1193, so it is divisible by 2.
What are the factors of 40562?
1, 2, 17, 34, 1193, 2386, 20281, 40562.
What is 40562 in binary?
1001111001110010 (hexadecimal 9E72, octal 117162).
What is the square root of 40562?
About 201.4001.
Is 40562 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 40562?
40562 is a Harshad number: divisible by its digit sum 17.