The number 59020
59020 is a composite number with 24 divisors. Its prime factorisation is × 5 × 13 × 227. Divisors (24): 1, 2, 4, 5, 10, 13, 20, 26, 52, 65, 130, 227, 260, 454, 908, 1135 … 59020.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59020 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59020 is composite. Its prime factorisation is
- 3
The divisors add up to 134064; without 59020 itself that is 75044, so 59020 is abundant (75044 is more than 59020). Euler's totient φ(59020) = 21696 numbers up to 59020 share no factor with it.
- 4
The digits of 59020 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59020 = 2^{2} \times 5 \times 13 \times 227 \]59020 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 134064 |
| Euler totient φ(n) | 21696 |
| Square | 3483360400 |
| Cube | 205587930808000 |
| Square root | 242.940322 (= 2√14755) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 104 |
| Scientific notation | 5.902 × |
59020 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and twenty |
| Binary (base 2) | 1110011010001100 |
| Octal (base 8) | 163214 |
| Hexadecimal (base 16) | E68C |
| Base 3 | 2222221221 |
| As time | 59020 seconds = 16 h 23 min 40 s |
Is 59020 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59020 ÷ 2 = 29510) | 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 (59020 ÷ 4 = 14755) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59020 ÷ 5 = 11804) | 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 3) | 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 (59020 ÷ 10 = 5902) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 59020 a prime number?
No. 59020 = × 5 × 13 × 227, so it is divisible by 2.
What are the factors of 59020?
1, 2, 4, 5, 10, 13, 20, 26, 52, 65, 130, 227, 260, 454, 908, 1135, 2270, 2951, 4540, 5902, 11804, 14755, 29510, 59020.
What is 59020 in binary?
1110011010001100 (hexadecimal E68C, octal 163214).
What is the square root of 59020?
About 242.9403, exactly 2√14755.
Is 59020 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 59020?
It is a composite number with 24 divisors.