The number 59050
59050 is a composite number with 12 divisors. Its prime factorisation is 2 × × 1181. Divisors (12): 1, 2, 5, 10, 25, 50, 1181, 2362, 5905, 11810, 29525, 59050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59050 is composite. Its prime factorisation is
- 3
The divisors add up to 109926; without 59050 itself that is 50876, so 59050 is deficient (50876 is less than 59050). Euler's totient φ(59050) = 23600 numbers up to 59050 share no factor with it.
- 4
The digits of 59050 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59050 = 2 \times 5^{2} \times 1181 \]59050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 109926 |
| Euler totient φ(n) | 23600 |
| Square | 3486902500 |
| Cube | 205901592625000 |
| Square root | 243.002058 (= 5√2362) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 42 |
| Scientific notation | 5.905 × |
59050 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and fifty |
| Binary (base 2) | 1110011010101010 |
| Octal (base 8) | 163252 |
| Hexadecimal (base 16) | E6AA |
| Base 3 | 10000000001 |
| As time | 59050 seconds = 16 h 24 min 10 s |
Is 59050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59050 ÷ 2 = 29525) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59050 ÷ 5 = 11810) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59050 ÷ 10 = 5905) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59050 a prime number?
No. 59050 = 2 × × 1181, so it is divisible by 2.
What are the factors of 59050?
1, 2, 5, 10, 25, 50, 1181, 2362, 5905, 11810, 29525, 59050.
What is 59050 in binary?
1110011010101010 (hexadecimal E6AA, octal 163252).
What is the square root of 59050?
About 243.0021, exactly 5√2362.
Is 59050 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 59050?
It is a composite number with 12 divisors.