The number 5603
5603 is a composite number with 4 divisors. Its prime factorisation is 13 × 431. Divisors (4): 1, 13, 431, 5603.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5603: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 431, the product of two primes.
- 2
5603 is composite. Its prime factorisation is
- 3
The divisors add up to 6048; without 5603 itself that is 445, so 5603 is deficient (445 is less than 5603). Euler's totient φ(5603) = 5160 numbers up to 5603 share no factor with it.
- 4
The digits of 5603 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5603 = 13 \times 431 \]
5603 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 6048 |
| Euler totient φ(n) | 5160 |
| Square | 31393609 |
| Cube | 175898391227 |
| Square root | 74.853190 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 36 |
| Scientific notation | 5.603 × |
5603 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and three |
| Binary (base 2) | 1010111100011 |
| Octal (base 8) | 12743 |
| Hexadecimal (base 16) | 15E3 |
| Base 3 | 21200112 |
| As time | 5603 seconds = 1 h 33 min 23 s |
Is 5603 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 5) | 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 4) | 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 5603 a prime number?
No. 5603 = 13 × 431, so it is divisible by 13.
What are the factors of 5603?
1, 13, 431, 5603.
What is 5603 in binary?
1010111100011 (hexadecimal 15E3, octal 12743).
What is the square root of 5603?
About 74.8532.
Is 5603 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 5603?
5603 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 13 × 431, the product of two primes.