The number 59147
59147 is a composite number with 8 divisors. Its prime factorisation is 11 × 19 × 283. Divisors (8): 1, 11, 19, 209, 283, 3113, 5377, 59147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59147 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59147 is composite. Its prime factorisation is
- 3
The divisors add up to 68160; without 59147 itself that is 9013, so 59147 is deficient (9013 is less than 59147). Euler's totient φ(59147) = 50760 numbers up to 59147 share no factor with it.
- 4
The digits of 59147 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 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59147 = 11 \times 19 \times 283 \]
59147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68160 |
| Euler totient φ(n) | 50760 |
| Square | 3498367609 |
| Cube | 206917948969523 |
| Square root | 243.201562 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.9147 × |
59147 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and forty-seven |
| Binary (base 2) | 1110011100001011 |
| Octal (base 8) | 163413 |
| Hexadecimal (base 16) | E70B |
| Base 3 | 10000010122 |
| As time | 59147 seconds = 16 h 25 min 47 s |
Is 59147 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | 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 5) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (59147 ÷ 11 = 5377) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59147 a prime number?
No. 59147 = 11 × 19 × 283, so it is divisible by 11.
What are the factors of 59147?
1, 11, 19, 209, 283, 3113, 5377, 59147.
What is 59147 in binary?
1110011100001011 (hexadecimal E70B, octal 163413).
What is the square root of 59147?
About 243.2016.
Is 59147 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 59147?
It is a composite number with 8 divisors.