The number 95694
95694 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 41 × 389. Divisors (16): 1, 2, 3, 6, 41, 82, 123, 246, 389, 778, 1167, 2334, 15949, 31898, 47847, 95694.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95694: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
95694 is composite. Its prime factorisation is
- 3
The divisors add up to 196560; without 95694 itself that is 100866, so 95694 is abundant (100866 is more than 95694). Euler's totient φ(95694) = 31040 numbers up to 95694 share no factor with it.
- 4
The digits of 95694 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95694 = 2 \times 3 \times 41 \times 389 \]
95694 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 196560 |
| Euler totient φ(n) | 31040 |
| Square | 9157341636 |
| Cube | 876302650515384 |
| Square root | 309.344468 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.5694 × |
95694 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand six hundred and ninety-four |
| Binary (base 2) | 10111010111001110 |
| Octal (base 8) | 272716 |
| Hexadecimal (base 16) | 175CE |
| Base 3 | 11212021020 |
| As time | 95694 seconds = 26 h 34 min 54 s |
Is 95694 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95694 ÷ 2 = 47847) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (95694 ÷ 3 = 31898) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 | Yes (95694 ÷ 6 = 15949) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95694 a prime number?
No. 95694 = 2 × 3 × 41 × 389, so it is divisible by 2.
What are the factors of 95694?
1, 2, 3, 6, 41, 82, 123, 246, 389, 778, 1167, 2334, 15949, 31898, 47847, 95694.
What is 95694 in binary?
10111010111001110 (hexadecimal 175CE, octal 272716).
What is the square root of 95694?
About 309.3445.
Is 95694 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 95694?
95694 is a happy number: repeatedly adding the squares of its digits reaches 1.