The number 80948
80948 is a composite number with 24 divisors. Its prime factorisation is × × 59. Divisors (24): 1, 2, 4, 7, 14, 28, 49, 59, 98, 118, 196, 236, 343, 413, 686, 826 … 80948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80948 is composite. Its prime factorisation is
- 3
The divisors add up to 168000; without 80948 itself that is 87052, so 80948 is abundant (87052 is more than 80948). Euler's totient φ(80948) = 34104 numbers up to 80948 share no factor with it.
- 4
The digits of 80948 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80948 = 2^{2} \times 7^{3} \times 59 \]80948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 168000 |
| Euler totient φ(n) | 34104 |
| Square | 6552578704 |
| Cube | 530418140931392 |
| Square root | 284.513620 (= 14√413) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 76 |
| Scientific notation | 8.0948 × |
80948 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand nine hundred and forty-eight |
| Binary (base 2) | 10011110000110100 |
| Octal (base 8) | 236064 |
| Hexadecimal (base 16) | 13C34 |
| Base 3 | 11010001002 |
| As time | 80948 seconds = 22 h 29 min 8 s |
Is 80948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (80948 ÷ 2 = 40474) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (80948 ÷ 4 = 20237) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (80948 ÷ 7 = 11564) | 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 2) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80948 a prime number?
No. 80948 = × × 59, so it is divisible by 2.
What are the factors of 80948?
1, 2, 4, 7, 14, 28, 49, 59, 98, 118, 196, 236, 343, 413, 686, 826, 1372, 1652, 2891, 5782, 11564, 20237, 40474, 80948.
What is 80948 in binary?
10011110000110100 (hexadecimal 13C34, octal 236064).
What is the square root of 80948?
About 284.5136, exactly 14√413.
Is 80948 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 80948?
It is a composite number with 24 divisors.