The number 59092
59092 is a composite number with 24 divisors. Its prime factorisation is × 11 × 17 × 79. Divisors (24): 1, 2, 4, 11, 17, 22, 34, 44, 68, 79, 158, 187, 316, 374, 748, 869 … 59092.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59092 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59092 is composite. Its prime factorisation is
- 3
The divisors add up to 120960; without 59092 itself that is 61868, so 59092 is abundant (61868 is more than 59092). Euler's totient φ(59092) = 24960 numbers up to 59092 share no factor with it.
- 4
The digits of 59092 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59092 = 2^{2} \times 11 \times 17 \times 79 \]59092 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 120960 |
| Euler totient φ(n) | 24960 |
| Square | 3491864464 |
| Cube | 206341254906688 |
| Square root | 243.088461 (= 2√14773) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 73 |
| Scientific notation | 5.9092 × |
59092 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand and ninety-two |
| Binary (base 2) | 1110011011010100 |
| Octal (base 8) | 163324 |
| Hexadecimal (base 16) | E6D4 |
| Base 3 | 10000001121 |
| As time | 59092 seconds = 16 h 24 min 52 s |
Is 59092 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59092 ÷ 2 = 29546) | 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 (59092 ÷ 4 = 14773) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (59092 ÷ 11 = 5372) | 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 59092 a prime number?
No. 59092 = × 11 × 17 × 79, so it is divisible by 2.
What are the factors of 59092?
1, 2, 4, 11, 17, 22, 34, 44, 68, 79, 158, 187, 316, 374, 748, 869, 1343, 1738, 2686, 3476, 5372, 14773, 29546, 59092.
What is 59092 in binary?
1110011011010100 (hexadecimal E6D4, octal 163324).
What is the square root of 59092?
About 243.0885, exactly 2√14773.
Is 59092 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 59092?
It is a composite number with 24 divisors.