The number 65032
65032 is a composite number with 16 divisors. Its prime factorisation is × 11 × 739. Divisors (16): 1, 2, 4, 8, 11, 22, 44, 88, 739, 1478, 2956, 5912, 8129, 16258, 32516, 65032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
65032 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
65032 is composite. Its prime factorisation is
- 3
The divisors add up to 133200; without 65032 itself that is 68168, so 65032 is abundant (68168 is more than 65032). Euler's totient φ(65032) = 29520 numbers up to 65032 share no factor with it.
- 4
The digits of 65032 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 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65032 = 2^{3} \times 11 \times 739 \]65032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 133200 |
| Euler totient φ(n) | 29520 |
| Square | 4229161024 |
| Cube | 275030799712768 |
| Square root | 255.013725 (= 2√16258) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 42 |
| Scientific notation | 6.5032 × |
65032 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand and thirty-two |
| Binary (base 2) | 1111111000001000 |
| Octal (base 8) | 177010 |
| Hexadecimal (base 16) | FE08 |
| Base 3 | 10022012121 |
| As time | 65032 seconds = 18 h 3 min 52 s |
Is 65032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (65032 ÷ 2 = 32516) | 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 (65032 ÷ 4 = 16258) | 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 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 | Yes (65032 ÷ 8 = 8129) | 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 | Yes (65032 ÷ 11 = 5912) | 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 65032 a prime number?
No. 65032 = × 11 × 739, so it is divisible by 2.
What are the factors of 65032?
1, 2, 4, 8, 11, 22, 44, 88, 739, 1478, 2956, 5912, 8129, 16258, 32516, 65032.
What is 65032 in binary?
1111111000001000 (hexadecimal FE08, octal 177010).
What is the square root of 65032?
About 255.0137, exactly 2√16258.
Is 65032 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 65032?
It is a composite number with 16 divisors.