The number 51038
51038 is a composite number with 12 divisors. Its prime factorisation is 2 × × 151. Divisors (12): 1, 2, 13, 26, 151, 169, 302, 338, 1963, 3926, 25519, 51038.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51038 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51038 is composite. Its prime factorisation is
- 3
The divisors add up to 83448; without 51038 itself that is 32410, so 51038 is deficient (32410 is less than 51038). Euler's totient φ(51038) = 23400 numbers up to 51038 share no factor with it.
- 4
The digits of 51038 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51038 = 2 \times 13^{2} \times 151 \]51038 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 83448 |
| Euler totient φ(n) | 23400 |
| Square | 2604877444 |
| Cube | 132947734986872 |
| Square root | 225.915914 (= 13√302) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.1038 × |
51038 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and thirty-eight |
| Binary (base 2) | 1100011101011110 |
| Octal (base 8) | 143536 |
| Hexadecimal (base 16) | C75E |
| Base 3 | 2121000022 |
| As time | 51038 seconds = 14 h 10 min 38 s |
Is 51038 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51038 ÷ 2 = 25519) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 1) | 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 6) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51038 a prime number?
No. 51038 = 2 × × 151, so it is divisible by 2.
What are the factors of 51038?
1, 2, 13, 26, 151, 169, 302, 338, 1963, 3926, 25519, 51038.
What is 51038 in binary?
1100011101011110 (hexadecimal C75E, octal 143536).
What is the square root of 51038?
About 225.9159, exactly 13√302.
Is 51038 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51038?
It is a composite number with 12 divisors.