The number 59852
59852 is a composite number with 12 divisors. Its prime factorisation is × 13 × 1151. Divisors (12): 1, 2, 4, 13, 26, 52, 1151, 2302, 4604, 14963, 29926, 59852.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
59852 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
59852 is composite. Its prime factorisation is
- 3
The divisors add up to 112896; without 59852 itself that is 53044, so 59852 is deficient (53044 is less than 59852). Euler's totient φ(59852) = 27600 numbers up to 59852 share no factor with it.
- 4
The digits of 59852 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 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59852 = 2^{2} \times 13 \times 1151 \]59852 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 112896 |
| Euler totient φ(n) | 27600 |
| Square | 3582261904 |
| Cube | 214405539478208 |
| Square root | 244.646684 (= 2√14963) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.9852 × |
59852 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand eight hundred and fifty-two |
| Binary (base 2) | 1110100111001100 |
| Octal (base 8) | 164714 |
| Hexadecimal (base 16) | E9CC |
| Base 3 | 10001002202 |
| As time | 59852 seconds = 16 h 37 min 32 s |
Is 59852 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (59852 ÷ 2 = 29926) | 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 (59852 ÷ 4 = 14963) | 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 2) | 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 1) | 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 59852 a prime number?
No. 59852 = × 13 × 1151, so it is divisible by 2.
What are the factors of 59852?
1, 2, 4, 13, 26, 52, 1151, 2302, 4604, 14963, 29926, 59852.
What is 59852 in binary?
1110100111001100 (hexadecimal E9CC, octal 164714).
What is the square root of 59852?
About 244.6467, exactly 2√14963.
Is 59852 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 59852?
It is a composite number with 12 divisors.