The number 78268
78268 is a composite number with 12 divisors. Its prime factorisation is × 17 × 1151. Divisors (12): 1, 2, 4, 17, 34, 68, 1151, 2302, 4604, 19567, 39134, 78268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
78268 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
78268 is composite. Its prime factorisation is
- 3
The divisors add up to 145152; without 78268 itself that is 66884, so 78268 is deficient (66884 is less than 78268). Euler's totient φ(78268) = 36800 numbers up to 78268 share no factor with it.
- 4
The digits of 78268 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 182 steps to reach 1.
LaTeX source of the formulas on this page
\[ 78268 = 2^{2} \times 17 \times 1151 \]78268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 145152 |
| Euler totient φ(n) | 36800 |
| Square | 6125879824 |
| Cube | 479460362064832 |
| Square root | 279.764186 (= 2√19567) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 182 |
| Scientific notation | 7.8268 × |
78268 in other forms
| Form | Value |
|---|---|
| In words | seventy-eight thousand two hundred and sixty-eight |
| Binary (base 2) | 10011000110111100 |
| Octal (base 8) | 230674 |
| Hexadecimal (base 16) | 131BC |
| Base 3 | 10222100211 |
| As time | 78268 seconds = 21 h 44 min 28 s |
Is 78268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (78268 ÷ 2 = 39134) | 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 (78268 ÷ 4 = 19567) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 1) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 78268 a prime number?
No. 78268 = × 17 × 1151, so it is divisible by 2.
What are the factors of 78268?
1, 2, 4, 17, 34, 68, 1151, 2302, 4604, 19567, 39134, 78268.
What is 78268 in binary?
10011000110111100 (hexadecimal 131BC, octal 230674).
What is the square root of 78268?
About 279.7642, exactly 2√19567.
Is 78268 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 78268?
It is a composite number with 12 divisors.