The number 51035
51035 is a composite number with 8 divisors. Its prime factorisation is 5 × 59 × 173. Divisors (8): 1, 5, 59, 173, 295, 865, 10207, 51035.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51035 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51035 is composite. Its prime factorisation is
- 3
The divisors add up to 62640; without 51035 itself that is 11605, so 51035 is deficient (11605 is less than 51035). Euler's totient φ(51035) = 39904 numbers up to 51035 share no factor with it.
- 4
The digits of 51035 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51035 = 5 \times 59 \times 173 \]
51035 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62640 |
| Euler totient φ(n) | 39904 |
| Square | 2604571225 |
| Cube | 132924292467875 |
| Square root | 225.909274 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1035 × |
51035 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and thirty-five |
| Binary (base 2) | 1100011101011011 |
| Octal (base 8) | 143533 |
| Hexadecimal (base 16) | C75B |
| Base 3 | 2121000012 |
| As time | 51035 seconds = 14 h 10 min 35 s |
Is 51035 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51035 ÷ 5 = 10207) | 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51035 a prime number?
No. 51035 = 5 × 59 × 173, so it is divisible by 5.
What are the factors of 51035?
1, 5, 59, 173, 295, 865, 10207, 51035.
What is 51035 in binary?
1100011101011011 (hexadecimal C75B, octal 143533).
What is the square root of 51035?
About 225.9093.
Is 51035 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 51035?
It is a composite number with 8 divisors.