The number 80695
80695 is a composite number with 4 divisors. Its prime factorisation is 5 × 16139. Divisors (4): 1, 5, 16139, 80695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 80695: a semiprime: 5 × 16139, the product of two primes.
- 2
80695 is composite. Its prime factorisation is
- 3
The divisors add up to 96840; without 80695 itself that is 16145, so 80695 is deficient (16145 is less than 80695). Euler's totient φ(80695) = 64552 numbers up to 80695 share no factor with it.
- 4
The digits of 80695 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 94 steps to reach 1.
LaTeX source of the formulas on this page
\[ 80695 = 5 \times 16139 \]
80695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96840 |
| Euler totient φ(n) | 64552 |
| Square | 6511683025 |
| Cube | 525460261702375 |
| Square root | 284.068654 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 94 |
| Scientific notation | 8.0695 × |
80695 in other forms
| Form | Value |
|---|---|
| In words | eighty thousand six hundred and ninety-five |
| Binary (base 2) | 10011101100110111 |
| Octal (base 8) | 235467 |
| Hexadecimal (base 16) | 13B37 |
| Base 3 | 11002200201 |
| As time | 80695 seconds = 22 h 24 min 55 s |
Is 80695 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 | No (remainder 1) | 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 (80695 ÷ 5 = 16139) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 80695 a prime number?
No. 80695 = 5 × 16139, so it is divisible by 5.
What are the factors of 80695?
1, 5, 16139, 80695.
What is 80695 in binary?
10011101100110111 (hexadecimal 13B37, octal 235467).
What is the square root of 80695?
About 284.0687.
Is 80695 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 80695?
80695 is a semiprime: 5 × 16139, the product of two primes.