The number 59143
59143 is a composite number with 12 divisors. Its prime factorisation is × 17 × 71. Divisors (12): 1, 7, 17, 49, 71, 119, 497, 833, 1207, 3479, 8449, 59143.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59143 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59143 is composite. Its prime factorisation is
- 3
The divisors add up to 73872; without 59143 itself that is 14729, so 59143 is deficient (14729 is less than 59143). Euler's totient φ(59143) = 47040 numbers up to 59143 share no factor with it.
- 4
The digits of 59143 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 210 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59143 = 7^{2} \times 17 \times 71 \]59143 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 73872 |
| Euler totient φ(n) | 47040 |
| Square | 3497894449 |
| Cube | 206875971397207 |
| Square root | 243.193339 (= 7√1207) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 210 |
| Scientific notation | 5.9143 × |
59143 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and forty-three |
| Binary (base 2) | 1110011100000111 |
| Octal (base 8) | 163407 |
| Hexadecimal (base 16) | E707 |
| Base 3 | 10000010111 |
| As time | 59143 seconds = 16 h 25 min 43 s |
Is 59143 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (59143 ÷ 7 = 8449) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59143 a prime number?
No. 59143 = × 17 × 71, so it is divisible by 7.
What are the factors of 59143?
1, 7, 17, 49, 71, 119, 497, 833, 1207, 3479, 8449, 59143.
What is 59143 in binary?
1110011100000111 (hexadecimal E707, octal 163407).
What is the square root of 59143?
About 243.1933, exactly 7√1207.
Is 59143 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 59143?
It is a composite number with 12 divisors.