The number 95909
95909 is a composite number with 4 divisors. Its prime factorisation is 11 × 8719. Divisors (4): 1, 11, 8719, 95909.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95909: a semiprime: 11 × 8719, the product of two primes.
- 2
95909 is composite. Its prime factorisation is
- 3
The divisors add up to 104640; without 95909 itself that is 8731, so 95909 is deficient (8731 is less than 95909). Euler's totient φ(95909) = 87180 numbers up to 95909 share no factor with it.
- 4
The digits of 95909 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95909 = 11 \times 8719 \]
95909 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 104640 |
| Euler totient φ(n) | 87180 |
| Square | 9198536281 |
| Cube | 882222416174429 |
| Square root | 309.691782 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.5909 × |
95909 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and nine |
| Binary (base 2) | 10111011010100101 |
| Octal (base 8) | 273245 |
| Hexadecimal (base 16) | 176A5 |
| Base 3 | 11212120012 |
| As time | 95909 seconds = 26 h 38 min 29 s |
Is 95909 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 2) | 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 5) | 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 | Yes (95909 ÷ 11 = 8719) | 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 95909 a prime number?
No. 95909 = 11 × 8719, so it is divisible by 11.
What are the factors of 95909?
1, 11, 8719, 95909.
What is 95909 in binary?
10111011010100101 (hexadecimal 176A5, octal 273245).
What is the square root of 95909?
About 309.6918.
Is 95909 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 95909?
95909 is a semiprime: 11 × 8719, the product of two primes.