The number 95692
95692 is a composite number with 12 divisors. Its prime factorisation is × 47 × 509. Divisors (12): 1, 2, 4, 47, 94, 188, 509, 1018, 2036, 23923, 47846, 95692.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95692 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95692 is composite. Its prime factorisation is
- 3
The divisors add up to 171360; without 95692 itself that is 75668, so 95692 is deficient (75668 is less than 95692). Euler's totient φ(95692) = 46736 numbers up to 95692 share no factor with it.
- 4
The digits of 95692 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95692 = 2^{2} \times 47 \times 509 \]95692 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 171360 |
| Euler totient φ(n) | 46736 |
| Square | 9156958864 |
| Cube | 876247707613888 |
| Square root | 309.341236 (= 2√23923) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.5692 × |
95692 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand six hundred and ninety-two |
| Binary (base 2) | 10111010111001100 |
| Octal (base 8) | 272714 |
| Hexadecimal (base 16) | 175CC |
| Base 3 | 11212021011 |
| As time | 95692 seconds = 26 h 34 min 52 s |
Is 95692 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95692 ÷ 2 = 47846) | 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 | Yes (95692 ÷ 4 = 23923) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95692 a prime number?
No. 95692 = × 47 × 509, so it is divisible by 2.
What are the factors of 95692?
1, 2, 4, 47, 94, 188, 509, 1018, 2036, 23923, 47846, 95692.
What is 95692 in binary?
10111010111001100 (hexadecimal 175CC, octal 272714).
What is the square root of 95692?
About 309.3412, exactly 2√23923.
Is 95692 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 95692?
It is a composite number with 12 divisors.