The number 1403
1403 is a composite number with 4 divisors. Its prime factorisation is 23 × 61. Divisors (4): 1, 23, 61, 1403.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1403: a semiprime: 23 × 61, the product of two primes.
- 2
1403 is composite. Its prime factorisation is
- 3
The divisors add up to 1488; without 1403 itself that is 85, so 1403 is deficient (85 is less than 1403). Euler's totient φ(1403) = 1320 numbers up to 1403 share no factor with it.
- 4
The digits of 1403 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1403 = 23 \times 61 \]
1403 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1488 |
| Euler totient φ(n) | 1320 |
| Square | 1968409 |
| Cube | 2761677827 |
| Square root | 37.456642 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 1.403 × |
1403 in other forms
| Form | Value |
|---|---|
| In words | one thousand four hundred and three |
| Roman numerals | MCDIII |
| Binary (base 2) | 10101111011 |
| Octal (base 8) | 2573 |
| Hexadecimal (base 16) | 57B |
| Base 3 | 1220222 |
| As time | 1403 seconds = 23 min 23 s |
Is 1403 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 3) | 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 8) | 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 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 1403 a prime number?
No. 1403 = 23 × 61, so it is divisible by 23.
What are the factors of 1403?
1, 23, 61, 1403.
What is 1403 in binary?
10101111011 (hexadecimal 57B, octal 2573).
What is the square root of 1403?
About 37.4566.
What is 1403 in Roman numerals?
MCDIII.
Is 1403 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 1403?
1403 is a semiprime: 23 × 61, the product of two primes.