The number 59150
59150 is a composite number with 36 divisors. Its prime factorisation is 2 × × 7 × . Divisors (36): 1, 2, 5, 7, 10, 13, 14, 25, 26, 35, 50, 65, 70, 91, 130, 169 … 59150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59150 is composite. Its prime factorisation is
- 3
The divisors add up to 136152; without 59150 itself that is 77002, so 59150 is abundant (77002 is more than 59150). Euler's totient φ(59150) = 18720 numbers up to 59150 share no factor with it.
- 4
The digits of 59150 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59150 = 2 \times 5^{2} \times 7 \times 13^{2} \]59150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 136152 |
| Euler totient φ(n) | 18720 |
| Square | 3498722500 |
| Cube | 206949435875000 |
| Square root | 243.207730 (= 65√14) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.915 × |
59150 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and fifty |
| Binary (base 2) | 1110011100001110 |
| Octal (base 8) | 163416 |
| Hexadecimal (base 16) | E70E |
| Base 3 | 10000010202 |
| As time | 59150 seconds = 16 h 25 min 50 s |
Is 59150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59150 ÷ 2 = 29575) | 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 | Yes (59150 ÷ 5 = 11830) | 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 | Yes (59150 ÷ 7 = 8450) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59150 ÷ 10 = 5915) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 59150 a prime number?
No. 59150 = 2 × × 7 × , so it is divisible by 2.
What are the factors of 59150?
1, 2, 5, 7, 10, 13, 14, 25, 26, 35, 50, 65, 70, 91, 130, 169, 175, 182, 325, 338, 350, 455, 650, 845, 910, 1183, 1690, 2275, 2366, 4225, 4550, 5915, 8450, 11830, 29575, 59150.
What is 59150 in binary?
1110011100001110 (hexadecimal E70E, octal 163416).
What is the square root of 59150?
About 243.2077, exactly 65√14.
Is 59150 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 59150?
It is a composite number with 36 divisors.