The number 5602
5602 is a composite number with 4 divisors. Its prime factorisation is 2 × 2801. Divisors (4): 1, 2, 2801, 5602.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5602: a semiprime: 2 × 2801, the product of two primes.
- 2
5602 is composite. Its prime factorisation is
- 3
The divisors add up to 8406; without 5602 itself that is 2804, so 5602 is deficient (2804 is less than 5602). Euler's totient φ(5602) = 2800 numbers up to 5602 share no factor with it.
- 4
The digits of 5602 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5602 = 2 \times 2801 \]
5602 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 8406 |
| Euler totient φ(n) | 2800 |
| Square | 31382404 |
| Cube | 175804227208 |
| Square root | 74.846510 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 36 |
| Scientific notation | 5.602 × |
5602 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and two |
| Binary (base 2) | 1010111100010 |
| Octal (base 8) | 12742 |
| Hexadecimal (base 16) | 15E2 |
| Base 3 | 21200111 |
| As time | 5602 seconds = 1 h 33 min 22 s |
Is 5602 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5602 ÷ 2 = 2801) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5602 a prime number?
No. 5602 = 2 × 2801, so it is divisible by 2.
What are the factors of 5602?
1, 2, 2801, 5602.
What is 5602 in binary?
1010111100010 (hexadecimal 15E2, octal 12742).
What is the square root of 5602?
About 74.8465.
Is 5602 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 5602?
5602 is a semiprime: 2 × 2801, the product of two primes.