The number 1761
1761 is a composite number with 4 divisors. Its prime factorisation is 3 × 587. Divisors (4): 1, 3, 587, 1761.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1761: a semiprime: 3 × 587, the product of two primes.
- 2
1761 is composite. Its prime factorisation is
- 3
The divisors add up to 2352; without 1761 itself that is 591, so 1761 is deficient (591 is less than 1761). Euler's totient φ(1761) = 1172 numbers up to 1761 share no factor with it.
- 4
The digits of 1761 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 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1761 = 3 \times 587 \]
1761 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2352 |
| Euler totient φ(n) | 1172 |
| Square | 3101121 |
| Cube | 5461074081 |
| Square root | 41.964271 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 104 |
| Scientific notation | 1.761 × |
1761 in other forms
| Form | Value |
|---|---|
| In words | one thousand seven hundred and sixty-one |
| Roman numerals | MDCCLXI |
| Binary (base 2) | 11011100001 |
| Octal (base 8) | 3341 |
| Hexadecimal (base 16) | 6E1 |
| Base 3 | 2102020 |
| As time | 1761 seconds = 29 min 21 s |
Is 1761 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 (1761 ÷ 3 = 587) | 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 1) | 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 1) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 1761 a prime number?
No. 1761 = 3 × 587, so it is divisible by 3.
What are the factors of 1761?
1, 3, 587, 1761.
What is 1761 in binary?
11011100001 (hexadecimal 6E1, octal 3341).
What is the square root of 1761?
About 41.9643.
What is 1761 in Roman numerals?
MDCCLXI.
Is 1761 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1761?
1761 is a semiprime: 3 × 587, the product of two primes.