The number 95946
95946 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 15991. Divisors (8): 1, 2, 3, 6, 15991, 31982, 47973, 95946.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95946: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
95946 is composite. Its prime factorisation is
- 3
The divisors add up to 191904; without 95946 itself that is 95958, so 95946 is abundant (95958 is more than 95946). Euler's totient φ(95946) = 31980 numbers up to 95946 share no factor with it.
- 4
The digits of 95946 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 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95946 = 2 \times 3 \times 15991 \]
95946 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 191904 |
| Euler totient φ(n) | 31980 |
| Square | 9205634916 |
| Cube | 883243847650536 |
| Square root | 309.751513 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 53 |
| Scientific notation | 9.5946 × |
95946 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand nine hundred and forty-six |
| Binary (base 2) | 10111011011001010 |
| Octal (base 8) | 273312 |
| Hexadecimal (base 16) | 176CA |
| Base 3 | 11212121120 |
| As time | 95946 seconds = 26 h 39 min 6 s |
Is 95946 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95946 ÷ 2 = 47973) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (95946 ÷ 3 = 31982) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (95946 ÷ 6 = 15991) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 95946 a prime number?
No. 95946 = 2 × 3 × 15991, so it is divisible by 2.
What are the factors of 95946?
1, 2, 3, 6, 15991, 31982, 47973, 95946.
What is 95946 in binary?
10111011011001010 (hexadecimal 176CA, octal 273312).
What is the square root of 95946?
About 309.7515.
Is 95946 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 95946?
95946 is a happy number: repeatedly adding the squares of its digits reaches 1.