The number 1703
1703 is a composite number with 4 divisors. Its prime factorisation is 13 × 131. Divisors (4): 1, 13, 131, 1703.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1703: a semiprime: 13 × 131, the product of two primes.
- 2
1703 is composite. Its prime factorisation is
- 3
The divisors add up to 1848; without 1703 itself that is 145, so 1703 is deficient (145 is less than 1703). Euler's totient φ(1703) = 1560 numbers up to 1703 share no factor with it.
- 4
The digits of 1703 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1703 = 13 \times 131 \]
1703 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1848 |
| Euler totient φ(n) | 1560 |
| Square | 2900209 |
| Cube | 4939055927 |
| Square root | 41.267421 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.703 × |
1703 in other forms
| Form | Value |
|---|---|
| In words | one thousand seven hundred and three |
| Roman numerals | MDCCIII |
| Binary (base 2) | 11010100111 |
| Octal (base 8) | 3247 |
| Hexadecimal (base 16) | 6A7 |
| Base 3 | 2100002 |
| As time | 1703 seconds = 28 min 23 s |
Is 1703 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 | No (remainder 3) | 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 2) | 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 2) | 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 9) | 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 1703 a prime number?
No. 1703 = 13 × 131, so it is divisible by 13.
What are the factors of 1703?
1, 13, 131, 1703.
What is 1703 in binary?
11010100111 (hexadecimal 6A7, octal 3247).
What is the square root of 1703?
About 41.2674.
What is 1703 in Roman numerals?
MDCCIII.
Is 1703 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1703?
1703 is a semiprime: 13 × 131, the product of two primes.