The number 59200
59200 is a composite number with 42 divisors. Its prime factorisation is × × 37. Divisors (42): 1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 37, 40, 50, 64, 74, 80 … 59200.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59200: a Harshad number: divisible by its digit sum 16.
- 2
59200 is composite. Its prime factorisation is
- 3
The divisors add up to 149606; without 59200 itself that is 90406, so 59200 is abundant (90406 is more than 59200). Euler's totient φ(59200) = 23040 numbers up to 59200 share no factor with it.
- 4
The digits of 59200 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 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59200 = 2^{6} \times 5^{2} \times 37 \]59200 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 42 |
| Sum of divisors | 149606 |
| Euler totient φ(n) | 23040 |
| Square | 3504640000 |
| Cube | 207474688000000 |
| Square root | 243.310501 (= 40√37) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.92 × |
59200 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand two hundred |
| Binary (base 2) | 1110011101000000 |
| Octal (base 8) | 163500 |
| Hexadecimal (base 16) | E740 |
| Base 3 | 10000012121 |
| As time | 59200 seconds = 16 h 26 min 40 s |
Is 59200 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59200 ÷ 2 = 29600) | 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 (59200 ÷ 4 = 14800) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (59200 ÷ 5 = 11840) | 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 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 (59200 ÷ 8 = 7400) | 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 (59200 ÷ 10 = 5920) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 59200 a prime number?
No. 59200 = × × 37, so it is divisible by 2.
What are the factors of 59200?
1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 37, 40, 50, 64, 74, 80, 100, 148, 160, 185, 200, 296, 320, 370, 400, 592, 740, 800, 925, 1184, 1480, 1600, 1850, 2368, 2960, 3700, 5920, 7400, 11840, 14800, 29600, 59200.
What is 59200 in binary?
1110011101000000 (hexadecimal E740, octal 163500).
What is the square root of 59200?
About 243.3105, exactly 40√37.
Is 59200 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 59200?
59200 is a Harshad number: divisible by its digit sum 16.