The number 59372
59372 is a composite number with 6 divisors. Its prime factorisation is × 14843. Divisors (6): 1, 2, 4, 14843, 29686, 59372.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59372 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59372 is composite. Its prime factorisation is
- 3
The divisors add up to 103908; without 59372 itself that is 44536, so 59372 is deficient (44536 is less than 59372). Euler's totient φ(59372) = 29684 numbers up to 59372 share no factor with it.
- 4
The digits of 59372 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59372 = 2^{2} \times 14843 \]59372 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 103908 |
| Euler totient φ(n) | 29684 |
| Square | 3525034384 |
| Cube | 209288341446848 |
| Square root | 243.663703 (= 2√14843) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.9372 × |
59372 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand three hundred and seventy-two |
| Binary (base 2) | 1110011111101100 |
| Octal (base 8) | 163754 |
| Hexadecimal (base 16) | E7EC |
| Base 3 | 10000102222 |
| As time | 59372 seconds = 16 h 29 min 32 s |
Is 59372 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59372 ÷ 2 = 29686) | 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 (59372 ÷ 4 = 14843) | 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 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 8) | 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 5) | 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 59372 a prime number?
No. 59372 = × 14843, so it is divisible by 2.
What are the factors of 59372?
1, 2, 4, 14843, 29686, 59372.
What is 59372 in binary?
1110011111101100 (hexadecimal E7EC, octal 163754).
What is the square root of 59372?
About 243.6637, exactly 2√14843.
Is 59372 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 59372?
It is a composite number with 6 divisors.