The number 67947
67947 is a composite number with 16 divisors. Its prime factorisation is 3 × 11 × 29 × 71. Divisors (16): 1, 3, 11, 29, 33, 71, 87, 213, 319, 781, 957, 2059, 2343, 6177, 22649, 67947.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 67947: a Harshad number: divisible by its digit sum 33.
- 2
67947 is composite. Its prime factorisation is
- 3
The divisors add up to 103680; without 67947 itself that is 35733, so 67947 is deficient (35733 is less than 67947). Euler's totient φ(67947) = 39200 numbers up to 67947 share no factor with it.
- 4
The digits of 67947 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 67947 = 3 \times 11 \times 29 \times 71 \]
67947 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 103680 |
| Euler totient φ(n) | 39200 |
| Square | 4616794809 |
| Cube | 313697356887123 |
| Square root | 260.666454 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 112 |
| Scientific notation | 6.7947 × |
67947 in other forms
| Form | Value |
|---|---|
| In words | sixty-seven thousand nine hundred and forty-seven |
| Binary (base 2) | 10000100101101011 |
| Octal (base 8) | 204553 |
| Hexadecimal (base 16) | 1096B |
| Base 3 | 10110012120 |
| As time | 67947 seconds = 18 h 52 min 27 s |
Is 67947 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (67947 ÷ 3 = 22649) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | 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 | No (remainder 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (67947 ÷ 11 = 6177) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 67947 a prime number?
No. 67947 = 3 × 11 × 29 × 71, so it is divisible by 3.
What are the factors of 67947?
1, 3, 11, 29, 33, 71, 87, 213, 319, 781, 957, 2059, 2343, 6177, 22649, 67947.
What is 67947 in binary?
10000100101101011 (hexadecimal 1096B, octal 204553).
What is the square root of 67947?
About 260.6665.
Is 67947 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 67947?
67947 is a Harshad number: divisible by its digit sum 33.