The number 5638
5638 is a composite number with 4 divisors. Its prime factorisation is 2 × 2819. Divisors (4): 1, 2, 2819, 5638.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5638: a semiprime: 2 × 2819, the product of two primes.
- 2
5638 is composite. Its prime factorisation is
- 3
The divisors add up to 8460; without 5638 itself that is 2822, so 5638 is deficient (2822 is less than 5638). Euler's totient φ(5638) = 2818 numbers up to 5638 share no factor with it.
- 4
The digits of 5638 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5638 = 2 \times 2819 \]
5638 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 8460 |
| Euler totient φ(n) | 2818 |
| Square | 31787044 |
| Cube | 179215354072 |
| Square root | 75.086617 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 85 |
| Scientific notation | 5.638 × |
5638 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and thirty-eight |
| Binary (base 2) | 1011000000110 |
| Octal (base 8) | 13006 |
| Hexadecimal (base 16) | 1606 |
| Base 3 | 21201211 |
| As time | 5638 seconds = 1 h 33 min 58 s |
Is 5638 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5638 ÷ 2 = 2819) | 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 3) | 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 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 6) | 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 8) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5638 a prime number?
No. 5638 = 2 × 2819, so it is divisible by 2.
What are the factors of 5638?
1, 2, 2819, 5638.
What is 5638 in binary?
1011000000110 (hexadecimal 1606, octal 13006).
What is the square root of 5638?
About 75.0866.
Is 5638 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 5638?
5638 is a semiprime: 2 × 2819, the product of two primes.