The number 80295
80295 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 53 × 101. Divisors (16): 1, 3, 5, 15, 53, 101, 159, 265, 303, 505, 795, 1515, 5353, 16059, 26765, 80295.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
80295 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
80295 is composite. Its prime factorisation is
- 3
The divisors add up to 132192; without 80295 itself that is 51897, so 80295 is deficient (51897 is less than 80295). Euler's totient φ(80295) = 41600 numbers up to 80295 share no factor with it.
- 4
The digits of 80295 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 213 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80295 = 3 \times 5 \times 53 \times 101 \]
80295 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 132192 |
| Euler totient φ(n) | 41600 |
| Square | 6447287025 |
| Cube | 517684911672375 |
| Square root | 283.363724 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 213 |
| Scientific notation | 8.0295 × |
80295 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand two hundred and ninety-five |
| Binary (base 2) | 10011100110100111 |
| Octal (base 8) | 234647 |
| Hexadecimal (base 16) | 139A7 |
| Base 3 | 11002010220 |
| As time | 80295 seconds = 22 h 18 min 15 s |
Is 80295 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 (80295 ÷ 3 = 26765) | 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 | Yes (80295 ÷ 5 = 16059) | 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 7) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | 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 80295 a prime number?
No. 80295 = 3 × 5 × 53 × 101, so it is divisible by 3.
What are the factors of 80295?
1, 3, 5, 15, 53, 101, 159, 265, 303, 505, 795, 1515, 5353, 16059, 26765, 80295.
What is 80295 in binary?
10011100110100111 (hexadecimal 139A7, octal 234647).
What is the square root of 80295?
About 283.3637.
Is 80295 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 80295?
It is a composite number with 16 divisors.