The number 95948
95948 is a composite number with 18 divisors. Its prime factorisation is × × 83. Divisors (18): 1, 2, 4, 17, 34, 68, 83, 166, 289, 332, 578, 1156, 1411, 2822, 5644, 23987 … 95948.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95948 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95948 is composite. Its prime factorisation is
- 3
The divisors add up to 180516; without 95948 itself that is 84568, so 95948 is deficient (84568 is less than 95948). Euler's totient φ(95948) = 44608 numbers up to 95948 share no factor with it.
- 4
The digits of 95948 add up to 35, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95948 = 2^{2} \times 17^{2} \times 83 \]95948 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 18 |
| Sum of divisors | 180516 |
| Euler totient φ(n) | 44608 |
| Square | 9206018704 |
| Cube | 883299082611392 |
| Square root | 309.754742 (= 34√83) |
| Digit sum / digital root | 35 / 8 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.5948 × |
95948 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and forty-eight |
| Binary (base 2) | 10111011011001100 |
| Octal (base 8) | 273314 |
| Hexadecimal (base 16) | 176CC |
| Base 3 | 11212121122 |
| As time | 95948 seconds = 26 h 39 min 8 s |
Is 95948 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95948 ÷ 2 = 47974) | 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 | Yes (95948 ÷ 4 = 23987) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95948 a prime number?
No. 95948 = × × 83, so it is divisible by 2.
What are the factors of 95948?
1, 2, 4, 17, 34, 68, 83, 166, 289, 332, 578, 1156, 1411, 2822, 5644, 23987, 47974, 95948.
What is 95948 in binary?
10111011011001100 (hexadecimal 176CC, octal 273314).
What is the square root of 95948?
About 309.7547, exactly 34√83.
Is 95948 divisible by 3?
No. Its digits add up to 35, which is not a multiple of 3.
What is special about the number 95948?
It is a composite number with 18 divisors.