The number 59642
59642 is a composite number with 8 divisors. Its prime factorisation is 2 × 11 × 2711. Divisors (8): 1, 2, 11, 22, 2711, 5422, 29821, 59642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59642 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59642 is composite. Its prime factorisation is
- 3
The divisors add up to 97632; without 59642 itself that is 37990, so 59642 is deficient (37990 is less than 59642). Euler's totient φ(59642) = 27100 numbers up to 59642 share no factor with it.
- 4
The digits of 59642 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59642 = 2 \times 11 \times 2711 \]
59642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 97632 |
| Euler totient φ(n) | 27100 |
| Square | 3557168164 |
| Cube | 212156623637288 |
| Square root | 244.217117 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9642 × |
59642 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand six hundred and forty-two |
| Binary (base 2) | 1110100011111010 |
| Octal (base 8) | 164372 |
| Hexadecimal (base 16) | E8FA |
| Base 3 | 10000210222 |
| As time | 59642 seconds = 16 h 34 min 2 s |
Is 59642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59642 ÷ 2 = 29821) | 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 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 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 | Yes (59642 ÷ 11 = 5422) | 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 59642 a prime number?
No. 59642 = 2 × 11 × 2711, so it is divisible by 2.
What are the factors of 59642?
1, 2, 11, 22, 2711, 5422, 29821, 59642.
What is 59642 in binary?
1110100011111010 (hexadecimal E8FA, octal 164372).
What is the square root of 59642?
About 244.2171.
Is 59642 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 59642?
It is a composite number with 8 divisors.