The number 59380
59380 is a composite number with 12 divisors. Its prime factorisation is × 5 × 2969. Divisors (12): 1, 2, 4, 5, 10, 20, 2969, 5938, 11876, 14845, 29690, 59380.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59380 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59380 is composite. Its prime factorisation is
- 3
The divisors add up to 124740; without 59380 itself that is 65360, so 59380 is abundant (65360 is more than 59380). Euler's totient φ(59380) = 23744 numbers up to 59380 share no factor with it.
- 4
The digits of 59380 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 241 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59380 = 2^{2} \times 5 \times 2969 \]59380 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 124740 |
| Euler totient φ(n) | 23744 |
| Square | 3525984400 |
| Cube | 209372953672000 |
| Square root | 243.680118 (= 2√14845) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 241 |
| Scientific notation | 5.938 × |
59380 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand three hundred and eighty |
| Binary (base 2) | 1110011111110100 |
| Octal (base 8) | 163764 |
| Hexadecimal (base 16) | E7F4 |
| Base 3 | 10000110021 |
| As time | 59380 seconds = 16 h 29 min 40 s |
Is 59380 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59380 ÷ 2 = 29690) | 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 | Yes (59380 ÷ 4 = 14845) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59380 ÷ 5 = 11876) | 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 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59380 ÷ 10 = 5938) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59380 a prime number?
No. 59380 = × 5 × 2969, so it is divisible by 2.
What are the factors of 59380?
1, 2, 4, 5, 10, 20, 2969, 5938, 11876, 14845, 29690, 59380.
What is 59380 in binary?
1110011111110100 (hexadecimal E7F4, octal 163764).
What is the square root of 59380?
About 243.6801, exactly 2√14845.
Is 59380 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 59380?
It is a composite number with 12 divisors.