The number 59142
59142 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 9857. Divisors (8): 1, 2, 3, 6, 9857, 19714, 29571, 59142.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59142 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59142 is composite. Its prime factorisation is
- 3
The divisors add up to 118296; without 59142 itself that is 59154, so 59142 is abundant (59154 is more than 59142). Euler's totient φ(59142) = 19712 numbers up to 59142 share no factor with it.
- 4
The digits of 59142 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59142 = 2 \times 3 \times 9857 \]
59142 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 118296 |
| Euler totient φ(n) | 19712 |
| Square | 3497776164 |
| Cube | 206865477891288 |
| Square root | 243.191283 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.9142 × |
59142 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and forty-two |
| Binary (base 2) | 1110011100000110 |
| Octal (base 8) | 163406 |
| Hexadecimal (base 16) | E706 |
| Base 3 | 10000010110 |
| As time | 59142 seconds = 16 h 25 min 42 s |
Is 59142 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59142 ÷ 2 = 29571) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (59142 ÷ 3 = 19714) | 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 | Yes (59142 ÷ 6 = 9857) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59142 a prime number?
No. 59142 = 2 × 3 × 9857, so it is divisible by 2.
What are the factors of 59142?
1, 2, 3, 6, 9857, 19714, 29571, 59142.
What is 59142 in binary?
1110011100000110 (hexadecimal E706, octal 163406).
What is the square root of 59142?
About 243.1913.
Is 59142 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 59142?
It is a composite number with 8 divisors.