The number 5646
5646 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 941. Divisors (8): 1, 2, 3, 6, 941, 1882, 2823, 5646.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
5646 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
5646 is composite. Its prime factorisation is
- 3
The divisors add up to 11304; without 5646 itself that is 5658, so 5646 is abundant (5658 is more than 5646). Euler's totient φ(5646) = 1880 numbers up to 5646 share no factor with it.
- 4
The digits of 5646 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 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5646 = 2 \times 3 \times 941 \]
5646 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 11304 |
| Euler totient φ(n) | 1880 |
| Square | 31877316 |
| Cube | 179979326136 |
| Square root | 75.139870 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 59 |
| Scientific notation | 5.646 × |
5646 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and forty-six |
| Binary (base 2) | 1011000001110 |
| Octal (base 8) | 13016 |
| Hexadecimal (base 16) | 160E |
| Base 3 | 21202010 |
| As time | 5646 seconds = 1 h 34 min 6 s |
Is 5646 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5646 ÷ 2 = 2823) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5646 ÷ 3 = 1882) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (5646 ÷ 6 = 941) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5646 a prime number?
No. 5646 = 2 × 3 × 941, so it is divisible by 2.
What are the factors of 5646?
1, 2, 3, 6, 941, 1882, 2823, 5646.
What is 5646 in binary?
1011000001110 (hexadecimal 160E, octal 13016).
What is the square root of 5646?
About 75.1399.
Is 5646 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 5646?
It is a composite number with 8 divisors.