The number 1713
1713 is a composite number with 4 divisors. Its prime factorisation is 3 × 571. Divisors (4): 1, 3, 571, 1713.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1713: a semiprime: 3 × 571, the product of two primes.
- 2
1713 is composite. Its prime factorisation is
- 3
The divisors add up to 2288; without 1713 itself that is 575, so 1713 is deficient (575 is less than 1713). Euler's totient φ(1713) = 1140 numbers up to 1713 share no factor with it.
- 4
The digits of 1713 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1713 = 3 \times 571 \]
1713 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2288 |
| Euler totient φ(n) | 1140 |
| Square | 2934369 |
| Cube | 5026574097 |
| Square root | 41.388404 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.713 × |
1713 in other forms
| Form | Value |
|---|---|
| In words | one thousand seven hundred and thirteen |
| Roman numerals | MDCCXIII |
| Binary (base 2) | 11010110001 |
| Octal (base 8) | 3261 |
| Hexadecimal (base 16) | 6B1 |
| Base 3 | 2100110 |
| As time | 1713 seconds = 28 min 33 s |
Is 1713 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 (1713 ÷ 3 = 571) | 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 3) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 1713 a prime number?
No. 1713 = 3 × 571, so it is divisible by 3.
What are the factors of 1713?
1, 3, 571, 1713.
What is 1713 in binary?
11010110001 (hexadecimal 6B1, octal 3261).
What is the square root of 1713?
About 41.3884.
What is 1713 in Roman numerals?
MDCCXIII.
Is 1713 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1713?
1713 is a semiprime: 3 × 571, the product of two primes.