The number 51039
51039 is a composite number with 12 divisors. Its prime factorisation is × 53 × 107. Divisors (12): 1, 3, 9, 53, 107, 159, 321, 477, 963, 5671, 17013, 51039.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51039 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51039 is composite. Its prime factorisation is
- 3
The divisors add up to 75816; without 51039 itself that is 24777, so 51039 is deficient (24777 is less than 51039). Euler's totient φ(51039) = 33072 numbers up to 51039 share no factor with it.
- 4
The digits of 51039 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
\[ 51039 = 3^{2} \times 53 \times 107 \]51039 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 75816 |
| Euler totient φ(n) | 33072 |
| Square | 2604979521 |
| Cube | 132955549772319 |
| Square root | 225.918127 (= 3√5671) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1039 × |
51039 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and thirty-nine |
| Binary (base 2) | 1100011101011111 |
| Octal (base 8) | 143537 |
| Hexadecimal (base 16) | C75F |
| Base 3 | 2121000100 |
| As time | 51039 seconds = 14 h 10 min 39 s |
Is 51039 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 (51039 ÷ 3 = 17013) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (51039 ÷ 9 = 5671) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51039 a prime number?
No. 51039 = × 53 × 107, so it is divisible by 3.
What are the factors of 51039?
1, 3, 9, 53, 107, 159, 321, 477, 963, 5671, 17013, 51039.
What is 51039 in binary?
1100011101011111 (hexadecimal C75F, octal 143537).
What is the square root of 51039?
About 225.9181, exactly 3√5671.
Is 51039 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51039?
It is a composite number with 12 divisors.