The number 80568
80568 is a composite number with 32 divisors. Its prime factorisation is × × 373. Divisors (32): 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 108, 216 … 80568.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80568: a Harshad number: divisible by its digit sum 27.
- 2
80568 is composite. Its prime factorisation is
- 3
The divisors add up to 224400; without 80568 itself that is 143832, so 80568 is abundant (143832 is more than 80568). Euler's totient φ(80568) = 26784 numbers up to 80568 share no factor with it.
- 4
The digits of 80568 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 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80568 = 2^{3} \times 3^{3} \times 373 \]80568 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 224400 |
| Euler totient φ(n) | 26784 |
| Square | 6491202624 |
| Cube | 522983213010432 |
| Square root | 283.845028 (= 6√2238) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 138 |
| Scientific notation | 8.0568 × |
80568 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand five hundred and sixty-eight |
| Binary (base 2) | 10011101010111000 |
| Octal (base 8) | 235270 |
| Hexadecimal (base 16) | 13AB8 |
| Base 3 | 11002112000 |
| As time | 80568 seconds = 22 h 22 min 48 s |
Is 80568 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80568 ÷ 2 = 40284) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (80568 ÷ 3 = 26856) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (80568 ÷ 4 = 20142) | 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 | Yes (80568 ÷ 6 = 13428) | 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 | Yes (80568 ÷ 8 = 10071) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (80568 ÷ 9 = 8952) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (80568 ÷ 12 = 6714) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80568 a prime number?
No. 80568 = × × 373, so it is divisible by 2.
What are the factors of 80568?
1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 27, 36, 54, 72, 108, 216, 373, 746, 1119, 1492, 2238, 2984, 3357, 4476, 6714, 8952, 10071, 13428, 20142, 26856, 40284, 80568.
What is 80568 in binary?
10011101010111000 (hexadecimal 13AB8, octal 235270).
What is the square root of 80568?
About 283.8450, exactly 6√2238.
Is 80568 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 80568?
80568 is a Harshad number: divisible by its digit sum 27.