The number 53237
53237 is a composite number with 4 divisors. Its prime factorisation is 139 × 383. Divisors (4): 1, 139, 383, 53237.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53237: a semiprime: 139 × 383, the product of two primes.
- 2
53237 is composite. Its prime factorisation is
- 3
The divisors add up to 53760; without 53237 itself that is 523, so 53237 is deficient (523 is less than 53237). Euler's totient φ(53237) = 52716 numbers up to 53237 share no factor with it.
- 4
The digits of 53237 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53237 = 139 \times 383 \]
53237 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53760 |
| Euler totient φ(n) | 52716 |
| Square | 2834178169 |
| Cube | 150883143183053 |
| Square root | 230.731446 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3237 × |
53237 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand two hundred and thirty-seven |
| Binary (base 2) | 1100111111110101 |
| Octal (base 8) | 147765 |
| Hexadecimal (base 16) | CFF5 |
| Base 3 | 2201000202 |
| As time | 53237 seconds = 14 h 47 min 17 s |
Is 53237 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 | No (remainder 1) | 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 5) | 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 5) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 53237 a prime number?
No. 53237 = 139 × 383, so it is divisible by 139.
What are the factors of 53237?
1, 139, 383, 53237.
What is 53237 in binary?
1100111111110101 (hexadecimal CFF5, octal 147765).
What is the square root of 53237?
About 230.7314.
Is 53237 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 53237?
53237 is a semiprime: 139 × 383, the product of two primes.