The number 6352
6352 is a composite number with 10 divisors. Its prime factorisation is × 397. Divisors (10): 1, 2, 4, 8, 16, 397, 794, 1588, 3176, 6352.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6352: a Harshad number: divisible by its digit sum 16.
- 2
6352 is composite. Its prime factorisation is
- 3
The divisors add up to 12338; without 6352 itself that is 5986, so 6352 is deficient (5986 is less than 6352). Euler's totient φ(6352) = 3168 numbers up to 6352 share no factor with it.
- 4
The digits of 6352 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6352 = 2^{4} \times 397 \]6352 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 12338 |
| Euler totient φ(n) | 3168 |
| Square | 40347904 |
| Cube | 256289886208 |
| Square root | 79.699435 (= 4√397) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 31 |
| Scientific notation | 6.352 × |
6352 in other forms
| Form | Value |
|---|---|
| In words | six thousand three hundred and fifty-two |
| Binary (base 2) | 1100011010000 |
| Octal (base 8) | 14320 |
| Hexadecimal (base 16) | 18D0 |
| Base 3 | 22201021 |
| As time | 6352 seconds = 1 h 45 min 52 s |
Is 6352 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6352 ÷ 2 = 3176) | 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 | Yes (6352 ÷ 4 = 1588) | 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 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 | Yes (6352 ÷ 8 = 794) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6352 a prime number?
No. 6352 = × 397, so it is divisible by 2.
What are the factors of 6352?
1, 2, 4, 8, 16, 397, 794, 1588, 3176, 6352.
What is 6352 in binary?
1100011010000 (hexadecimal 18D0, octal 14320).
What is the square root of 6352?
About 79.6994, exactly 4√397.
Is 6352 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 6352?
6352 is a Harshad number: divisible by its digit sum 16.