The number 67851
67851 is a composite number with 16 divisors. Its prime factorisation is × 7 × 359. Divisors (16): 1, 3, 7, 9, 21, 27, 63, 189, 359, 1077, 2513, 3231, 7539, 9693, 22617, 67851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 67851: a Harshad number: divisible by its digit sum 27.
- 2
67851 is composite. Its prime factorisation is
- 3
The divisors add up to 115200; without 67851 itself that is 47349, so 67851 is deficient (47349 is less than 67851). Euler's totient φ(67851) = 38664 numbers up to 67851 share no factor with it.
- 4
The digits of 67851 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 67851 = 3^{3} \times 7 \times 359 \]67851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 115200 |
| Euler totient φ(n) | 38664 |
| Square | 4603758201 |
| Cube | 312369597696051 |
| Square root | 260.482245 (= 3√7539) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.7851 × |
67851 in other forms
| Form | Value |
|---|---|
| In words | sixty-seven thousand eight hundred and fifty-one |
| Binary (base 2) | 10000100100001011 |
| Octal (base 8) | 204413 |
| Hexadecimal (base 16) | 1090B |
| Base 3 | 10110002000 |
| As time | 67851 seconds = 18 h 50 min 51 s |
Is 67851 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 (67851 ÷ 3 = 22617) | 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 1) | 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 | Yes (67851 ÷ 7 = 9693) | 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 | Yes (67851 ÷ 9 = 7539) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 67851 a prime number?
No. 67851 = × 7 × 359, so it is divisible by 3.
What are the factors of 67851?
1, 3, 7, 9, 21, 27, 63, 189, 359, 1077, 2513, 3231, 7539, 9693, 22617, 67851.
What is 67851 in binary?
10000100100001011 (hexadecimal 1090B, octal 204413).
What is the square root of 67851?
About 260.4822, exactly 3√7539.
Is 67851 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 67851?
67851 is a Harshad number: divisible by its digit sum 27.