The number 5637
5637 is a composite number with 4 divisors. Its prime factorisation is 3 × 1879. Divisors (4): 1, 3, 1879, 5637.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5637: a semiprime: 3 × 1879, the product of two primes.
- 2
5637 is composite. Its prime factorisation is
- 3
The divisors add up to 7520; without 5637 itself that is 1883, so 5637 is deficient (1883 is less than 5637). Euler's totient φ(5637) = 3756 numbers up to 5637 share no factor with it.
- 4
The digits of 5637 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5637 = 3 \times 1879 \]
5637 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7520 |
| Euler totient φ(n) | 3756 |
| Square | 31775769 |
| Cube | 179120009853 |
| Square root | 75.079957 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 85 |
| Scientific notation | 5.637 × |
5637 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and thirty-seven |
| Binary (base 2) | 1011000000101 |
| Octal (base 8) | 13005 |
| Hexadecimal (base 16) | 1605 |
| Base 3 | 21201210 |
| As time | 5637 seconds = 1 h 33 min 57 s |
Is 5637 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 | Yes (5637 ÷ 3 = 1879) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5637 a prime number?
No. 5637 = 3 × 1879, so it is divisible by 3.
What are the factors of 5637?
1, 3, 1879, 5637.
What is 5637 in binary?
1011000000101 (hexadecimal 1605, octal 13005).
What is the square root of 5637?
About 75.0800.
Is 5637 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 5637?
5637 is a semiprime: 3 × 1879, the product of two primes.