The number 59042
59042 is a composite number with 8 divisors. Its prime factorisation is 2 × 53 × 557. Divisors (8): 1, 2, 53, 106, 557, 1114, 29521, 59042.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59042 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59042 is composite. Its prime factorisation is
- 3
The divisors add up to 90396; without 59042 itself that is 31354, so 59042 is deficient (31354 is less than 59042). Euler's totient φ(59042) = 28912 numbers up to 59042 share no factor with it.
- 4
The digits of 59042 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 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59042 = 2 \times 53 \times 557 \]
59042 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90396 |
| Euler totient φ(n) | 28912 |
| Square | 3485957764 |
| Cube | 205817918302088 |
| Square root | 242.985596 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.9042 × |
59042 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and forty-two |
| Binary (base 2) | 1110011010100010 |
| Octal (base 8) | 163242 |
| Hexadecimal (base 16) | E6A2 |
| Base 3 | 2222222202 |
| As time | 59042 seconds = 16 h 24 min 2 s |
Is 59042 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59042 ÷ 2 = 29521) | 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 2) | 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 59042 a prime number?
No. 59042 = 2 × 53 × 557, so it is divisible by 2.
What are the factors of 59042?
1, 2, 53, 106, 557, 1114, 29521, 59042.
What is 59042 in binary?
1110011010100010 (hexadecimal E6A2, octal 163242).
What is the square root of 59042?
About 242.9856.
Is 59042 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 59042?
It is a composite number with 8 divisors.