The number 6032
6032 is a composite number with 20 divisors. Its prime factorisation is × 13 × 29. Divisors (20): 1, 2, 4, 8, 13, 16, 26, 29, 52, 58, 104, 116, 208, 232, 377, 464 … 6032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6032: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
6032 is composite. Its prime factorisation is
- 3
The divisors add up to 13020; without 6032 itself that is 6988, so 6032 is abundant (6988 is more than 6032). Euler's totient φ(6032) = 2688 numbers up to 6032 share no factor with it.
- 4
The digits of 6032 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6032 = 2^{4} \times 13 \times 29 \]6032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 13020 |
| Euler totient φ(n) | 2688 |
| Square | 36385024 |
| Cube | 219474464768 |
| Square root | 77.665951 (= 4√377) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 67 |
| Scientific notation | 6.032 × |
6032 in other forms
| Form | Value |
|---|---|
| In words | six thousand and thirty-two |
| Binary (base 2) | 1011110010000 |
| Octal (base 8) | 13620 |
| Hexadecimal (base 16) | 1790 |
| Base 3 | 22021102 |
| As time | 6032 seconds = 1 h 40 min 32 s |
Is 6032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6032 ÷ 2 = 3016) | 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 | Yes (6032 ÷ 4 = 1508) | 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 | No (remainder 5) | 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 (6032 ÷ 8 = 754) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6032 a prime number?
No. 6032 = × 13 × 29, so it is divisible by 2.
What are the factors of 6032?
1, 2, 4, 8, 13, 16, 26, 29, 52, 58, 104, 116, 208, 232, 377, 464, 754, 1508, 3016, 6032.
What is 6032 in binary?
1011110010000 (hexadecimal 1790, octal 13620).
What is the square root of 6032?
About 77.6660, exactly 4√377.
Is 6032 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 6032?
6032 is a happy number: repeatedly adding the squares of its digits reaches 1.