The number 59492
59492 is a composite number with 12 divisors. Its prime factorisation is × 107 × 139. Divisors (12): 1, 2, 4, 107, 139, 214, 278, 428, 556, 14873, 29746, 59492.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59492 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59492 is composite. Its prime factorisation is
- 3
The divisors add up to 105840; without 59492 itself that is 46348, so 59492 is deficient (46348 is less than 59492). Euler's totient φ(59492) = 29256 numbers up to 59492 share no factor with it.
- 4
The digits of 59492 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59492 = 2^{2} \times 107 \times 139 \]59492 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 105840 |
| Euler totient φ(n) | 29256 |
| Square | 3539298064 |
| Cube | 210559920423488 |
| Square root | 243.909819 (= 2√14873) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.9492 × |
59492 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand four hundred and ninety-two |
| Binary (base 2) | 1110100001100100 |
| Octal (base 8) | 164144 |
| Hexadecimal (base 16) | E864 |
| Base 3 | 10000121102 |
| As time | 59492 seconds = 16 h 31 min 32 s |
Is 59492 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59492 ÷ 2 = 29746) | 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 (59492 ÷ 4 = 14873) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 4) | 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 59492 a prime number?
No. 59492 = × 107 × 139, so it is divisible by 2.
What are the factors of 59492?
1, 2, 4, 107, 139, 214, 278, 428, 556, 14873, 29746, 59492.
What is 59492 in binary?
1110100001100100 (hexadecimal E864, octal 164144).
What is the square root of 59492?
About 243.9098, exactly 2√14873.
Is 59492 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 59492?
It is a composite number with 12 divisors.