The number 5642
5642 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 13 × 31. Divisors (16): 1, 2, 7, 13, 14, 26, 31, 62, 91, 182, 217, 403, 434, 806, 2821, 5642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5642 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5642 is composite. Its prime factorisation is
- 3
The divisors add up to 10752; without 5642 itself that is 5110, so 5642 is deficient (5110 is less than 5642). Euler's totient φ(5642) = 2160 numbers up to 5642 share no factor with it.
- 4
The digits of 5642 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5642 = 2 \times 7 \times 13 \times 31 \]
5642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 10752 |
| Euler totient φ(n) | 2160 |
| Square | 31832164 |
| Cube | 179597069288 |
| Square root | 75.113248 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 36 |
| Scientific notation | 5.642 × |
5642 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and forty-two |
| Binary (base 2) | 1011000001010 |
| Octal (base 8) | 13012 |
| Hexadecimal (base 16) | 160A |
| Base 3 | 21201222 |
| As time | 5642 seconds = 1 h 34 min 2 s |
Is 5642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5642 ÷ 2 = 2821) | 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 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (5642 ÷ 7 = 806) | 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 8) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5642 a prime number?
No. 5642 = 2 × 7 × 13 × 31, so it is divisible by 2.
What are the factors of 5642?
1, 2, 7, 13, 14, 26, 31, 62, 91, 182, 217, 403, 434, 806, 2821, 5642.
What is 5642 in binary?
1011000001010 (hexadecimal 160A, octal 13012).
What is the square root of 5642?
About 75.1132.
Is 5642 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 5642?
It is a composite number with 16 divisors.