The number 51135
51135 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 487. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 105, 487, 1461, 2435, 3409, 7305, 10227, 17045, 51135.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51135: a Harshad number: divisible by its digit sum 15.
- 2
51135 is composite. Its prime factorisation is
- 3
The divisors add up to 93696; without 51135 itself that is 42561, so 51135 is deficient (42561 is less than 51135). Euler's totient φ(51135) = 23328 numbers up to 51135 share no factor with it.
- 4
The digits of 51135 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51135 = 3 \times 5 \times 7 \times 487 \]
51135 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93696 |
| Euler totient φ(n) | 23328 |
| Square | 2614788225 |
| Cube | 133707195885375 |
| Square root | 226.130493 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.1135 × |
51135 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand one hundred and thirty-five |
| Binary (base 2) | 1100011110111111 |
| Octal (base 8) | 143677 |
| Hexadecimal (base 16) | C7BF |
| Base 3 | 2121010220 |
| As time | 51135 seconds = 14 h 12 min 15 s |
Is 51135 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 (51135 ÷ 3 = 17045) | 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 (51135 ÷ 5 = 10227) | 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 | Yes (51135 ÷ 7 = 7305) | 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 | No (remainder 6) | 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 7) | 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 51135 a prime number?
No. 51135 = 3 × 5 × 7 × 487, so it is divisible by 3.
What are the factors of 51135?
1, 3, 5, 7, 15, 21, 35, 105, 487, 1461, 2435, 3409, 7305, 10227, 17045, 51135.
What is 51135 in binary?
1100011110111111 (hexadecimal C7BF, octal 143677).
What is the square root of 51135?
About 226.1305.
Is 51135 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51135?
51135 is a Harshad number: divisible by its digit sum 15.