The number 59072
59072 is a composite number with 28 divisors. Its prime factorisation is × 13 × 71. Divisors (28): 1, 2, 4, 8, 13, 16, 26, 32, 52, 64, 71, 104, 142, 208, 284, 416 … 59072.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59072 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59072 is composite. Its prime factorisation is
- 3
The divisors add up to 128016; without 59072 itself that is 68944, so 59072 is abundant (68944 is more than 59072). Euler's totient φ(59072) = 26880 numbers up to 59072 share no factor with it.
- 4
The digits of 59072 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59072 = 2^{6} \times 13 \times 71 \]59072 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 28 |
| Sum of divisors | 128016 |
| Euler totient φ(n) | 26880 |
| Square | 3489501184 |
| Cube | 206131813941248 |
| Square root | 243.047320 (= 8√923) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9072 × |
59072 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and seventy-two |
| Binary (base 2) | 1110011011000000 |
| Octal (base 8) | 163300 |
| Hexadecimal (base 16) | E6C0 |
| Base 3 | 10000000212 |
| As time | 59072 seconds = 16 h 24 min 32 s |
Is 59072 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59072 ÷ 2 = 29536) | 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 (59072 ÷ 4 = 14768) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 | Yes (59072 ÷ 8 = 7384) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 59072 a prime number?
No. 59072 = × 13 × 71, so it is divisible by 2.
What are the factors of 59072?
1, 2, 4, 8, 13, 16, 26, 32, 52, 64, 71, 104, 142, 208, 284, 416, 568, 832, 923, 1136, 1846, 2272, 3692, 4544, 7384, 14768, 29536, 59072.
What is 59072 in binary?
1110011011000000 (hexadecimal E6C0, octal 163300).
What is the square root of 59072?
About 243.0473, exactly 8√923.
Is 59072 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 59072?
It is a composite number with 28 divisors.