The number 95952
95952 is a composite number with 20 divisors. Its prime factorisation is × 3 × 1999. Divisors (20): 1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1999, 3998, 5997, 7996, 11994, 15992 … 95952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95952 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95952 is composite. Its prime factorisation is
- 3
The divisors add up to 248000; without 95952 itself that is 152048, so 95952 is abundant (152048 is more than 95952). Euler's totient φ(95952) = 31968 numbers up to 95952 share no factor with it.
- 4
The digits of 95952 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 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95952 = 2^{4} \times 3 \times 1999 \]95952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 248000 |
| Euler totient φ(n) | 31968 |
| Square | 9206786304 |
| Cube | 883409559441408 |
| Square root | 309.761198 (= 4√5997) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.5952 × |
95952 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and fifty-two |
| Binary (base 2) | 10111011011010000 |
| Octal (base 8) | 273320 |
| Hexadecimal (base 16) | 176D0 |
| Base 3 | 11212121210 |
| As time | 95952 seconds = 26 h 39 min 12 s |
Is 95952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95952 ÷ 2 = 47976) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (95952 ÷ 3 = 31984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (95952 ÷ 4 = 23988) | 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 | Yes (95952 ÷ 6 = 15992) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 | Yes (95952 ÷ 8 = 11994) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (95952 ÷ 12 = 7996) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95952 a prime number?
No. 95952 = × 3 × 1999, so it is divisible by 2.
What are the factors of 95952?
1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 1999, 3998, 5997, 7996, 11994, 15992, 23988, 31984, 47976, 95952.
What is 95952 in binary?
10111011011010000 (hexadecimal 176D0, octal 273320).
What is the square root of 95952?
About 309.7612, exactly 4√5997.
Is 95952 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 95952?
It is a composite number with 20 divisors.