The number 95709
95709 is a composite number with 8 divisors. Its prime factorisation is 3 × 61 × 523. Divisors (8): 1, 3, 61, 183, 523, 1569, 31903, 95709.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95709: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
95709 is composite. Its prime factorisation is
- 3
The divisors add up to 129952; without 95709 itself that is 34243, so 95709 is deficient (34243 is less than 95709). Euler's totient φ(95709) = 62640 numbers up to 95709 share no factor with it.
- 4
The digits of 95709 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95709 = 3 \times 61 \times 523 \]
95709 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 129952 |
| Euler totient φ(n) | 62640 |
| Square | 9160212681 |
| Cube | 876714795485829 |
| Square root | 309.368712 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.5709 × |
95709 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand seven hundred and nine |
| Binary (base 2) | 10111010111011101 |
| Octal (base 8) | 272735 |
| Hexadecimal (base 16) | 175DD |
| Base 3 | 11212021210 |
| As time | 95709 seconds = 26 h 35 min 9 s |
Is 95709 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 (95709 ÷ 3 = 31903) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95709 a prime number?
No. 95709 = 3 × 61 × 523, so it is divisible by 3.
What are the factors of 95709?
1, 3, 61, 183, 523, 1569, 31903, 95709.
What is 95709 in binary?
10111010111011101 (hexadecimal 175DD, octal 272735).
What is the square root of 95709?
About 309.3687.
Is 95709 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 95709?
95709 is a happy number: repeatedly adding the squares of its digits reaches 1.