The number 96809
96809 is a composite number with 4 divisors. Its prime factorisation is 131 × 739. Divisors (4): 1, 131, 739, 96809.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 96809: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 131 × 739, the product of two primes.
- 2
96809 is composite. Its prime factorisation is
- 3
The divisors add up to 97680; without 96809 itself that is 871, so 96809 is deficient (871 is less than 96809). Euler's totient φ(96809) = 95940 numbers up to 96809 share no factor with it.
- 4
The digits of 96809 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 96809 = 131 \times 739 \]
96809 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 97680 |
| Euler totient φ(n) | 95940 |
| Square | 9371982481 |
| Cube | 907292252003129 |
| Square root | 311.141447 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.6809 × |
96809 in other forms
| Form | Value |
|---|---|
| In words | ninety-six thousand eight hundred and nine |
| Binary (base 2) | 10111101000101001 |
| Octal (base 8) | 275051 |
| Hexadecimal (base 16) | 17A29 |
| Base 3 | 11220210112 |
| As time | 96809 seconds = 26 h 53 min 29 s |
Is 96809 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 96809 a prime number?
No. 96809 = 131 × 739, so it is divisible by 131.
What are the factors of 96809?
1, 131, 739, 96809.
What is 96809 in binary?
10111101000101001 (hexadecimal 17A29, octal 275051).
What is the square root of 96809?
About 311.1414.
Is 96809 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 96809?
96809 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 131 × 739, the product of two primes.