The number 59980
59980 is a composite number with 12 divisors. Its prime factorisation is × 5 × 2999. Divisors (12): 1, 2, 4, 5, 10, 20, 2999, 5998, 11996, 14995, 29990, 59980.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59980 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59980 is composite. Its prime factorisation is
- 3
The divisors add up to 126000; without 59980 itself that is 66020, so 59980 is abundant (66020 is more than 59980). Euler's totient φ(59980) = 23984 numbers up to 59980 share no factor with it.
- 4
The digits of 59980 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59980 = 2^{2} \times 5 \times 2999 \]59980 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 126000 |
| Euler totient φ(n) | 23984 |
| Square | 3597600400 |
| Cube | 215784071992000 |
| Square root | 244.908146 (= 2√14995) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.998 × |
59980 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand nine hundred and eighty |
| Binary (base 2) | 1110101001001100 |
| Octal (base 8) | 165114 |
| Hexadecimal (base 16) | EA4C |
| Base 3 | 10001021111 |
| As time | 59980 seconds = 16 h 39 min 40 s |
Is 59980 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59980 ÷ 2 = 29990) | 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 (59980 ÷ 4 = 14995) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59980 ÷ 5 = 11996) | 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 4) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (59980 ÷ 10 = 5998) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 59980 a prime number?
No. 59980 = × 5 × 2999, so it is divisible by 2.
What are the factors of 59980?
1, 2, 4, 5, 10, 20, 2999, 5998, 11996, 14995, 29990, 59980.
What is 59980 in binary?
1110101001001100 (hexadecimal EA4C, octal 165114).
What is the square root of 59980?
About 244.9081, exactly 2√14995.
Is 59980 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 59980?
It is a composite number with 12 divisors.