The number 51237
51237 is a composite number with 6 divisors. Its prime factorisation is × 5693. Divisors (6): 1, 3, 9, 5693, 17079, 51237.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51237 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51237 is composite. Its prime factorisation is
- 3
The divisors add up to 74022; without 51237 itself that is 22785, so 51237 is deficient (22785 is less than 51237). Euler's totient φ(51237) = 34152 numbers up to 51237 share no factor with it.
- 4
The digits of 51237 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51237 = 3^{2} \times 5693 \]51237 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 74022 |
| Euler totient φ(n) | 34152 |
| Square | 2625230169 |
| Cube | 134508918169053 |
| Square root | 226.355914 (= 3√5693) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1237 × |
51237 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand two hundred and thirty-seven |
| Binary (base 2) | 1100100000100101 |
| Octal (base 8) | 144045 |
| Hexadecimal (base 16) | C825 |
| Base 3 | 2121021200 |
| As time | 51237 seconds = 14 h 13 min 57 s |
Is 51237 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 | Yes (51237 ÷ 3 = 17079) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | Yes (51237 ÷ 9 = 5693) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51237 a prime number?
No. 51237 = × 5693, so it is divisible by 3.
What are the factors of 51237?
1, 3, 9, 5693, 17079, 51237.
What is 51237 in binary?
1100100000100101 (hexadecimal C825, octal 144045).
What is the square root of 51237?
About 226.3559, exactly 3√5693.
Is 51237 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51237?
It is a composite number with 6 divisors.