The number 68032
68032 is a composite number with 14 divisors. Its prime factorisation is × 1063. Divisors (14): 1, 2, 4, 8, 16, 32, 64, 1063, 2126, 4252, 8504, 17008, 34016, 68032.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
68032 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
68032 is composite. Its prime factorisation is
- 3
The divisors add up to 135128; without 68032 itself that is 67096, so 68032 is deficient (67096 is less than 68032). Euler's totient φ(68032) = 33984 numbers up to 68032 share no factor with it.
- 4
The digits of 68032 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68032 = 2^{6} \times 1063 \]68032 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 14 |
| Sum of divisors | 135128 |
| Euler totient φ(n) | 33984 |
| Square | 4628353024 |
| Cube | 314876112928768 |
| Square root | 260.829446 (= 8√1063) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 81 |
| Scientific notation | 6.8032 × |
68032 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand and thirty-two |
| Binary (base 2) | 10000100111000000 |
| Octal (base 8) | 204700 |
| Hexadecimal (base 16) | 109C0 |
| Base 3 | 10110022201 |
| As time | 68032 seconds = 18 h 53 min 52 s |
Is 68032 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68032 ÷ 2 = 34016) | 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 (68032 ÷ 4 = 17008) | 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 6) | 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 (68032 ÷ 8 = 8504) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 8) | 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 68032 a prime number?
No. 68032 = × 1063, so it is divisible by 2.
What are the factors of 68032?
1, 2, 4, 8, 16, 32, 64, 1063, 2126, 4252, 8504, 17008, 34016, 68032.
What is 68032 in binary?
10000100111000000 (hexadecimal 109C0, octal 204700).
What is the square root of 68032?
About 260.8294, exactly 8√1063.
Is 68032 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 68032?
It is a composite number with 14 divisors.