The number 59480
59480 is a composite number with 16 divisors. Its prime factorisation is × 5 × 1487. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 1487, 2974, 5948, 7435, 11896, 14870, 29740, 59480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59480 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59480 is composite. Its prime factorisation is
- 3
The divisors add up to 133920; without 59480 itself that is 74440, so 59480 is abundant (74440 is more than 59480). Euler's totient φ(59480) = 23776 numbers up to 59480 share no factor with it.
- 4
The digits of 59480 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59480 = 2^{3} \times 5 \times 1487 \]59480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 133920 |
| Euler totient φ(n) | 23776 |
| Square | 3537870400 |
| Cube | 210432531392000 |
| Square root | 243.885219 (= 2√14870) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.948 × |
59480 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and eighty |
| Binary (base 2) | 1110100001011000 |
| Octal (base 8) | 164130 |
| Hexadecimal (base 16) | E858 |
| Base 3 | 10000120222 |
| As time | 59480 seconds = 16 h 31 min 20 s |
Is 59480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59480 ÷ 2 = 29740) | 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 | Yes (59480 ÷ 4 = 14870) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59480 ÷ 5 = 11896) | 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 | No (remainder 1) | 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 | Yes (59480 ÷ 8 = 7435) | 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 | Yes (59480 ÷ 10 = 5948) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59480 a prime number?
No. 59480 = × 5 × 1487, so it is divisible by 2.
What are the factors of 59480?
1, 2, 4, 5, 8, 10, 20, 40, 1487, 2974, 5948, 7435, 11896, 14870, 29740, 59480.
What is 59480 in binary?
1110100001011000 (hexadecimal E858, octal 164130).
What is the square root of 59480?
About 243.8852, exactly 2√14870.
Is 59480 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 59480?
It is a composite number with 16 divisors.