The number 95612
95612 is a composite number with 24 divisors. Its prime factorisation is × 11 × 41 × 53. Divisors (24): 1, 2, 4, 11, 22, 41, 44, 53, 82, 106, 164, 212, 451, 583, 902, 1166 … 95612.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95612 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95612 is composite. Its prime factorisation is
- 3
The divisors add up to 190512; without 95612 itself that is 94900, so 95612 is deficient (94900 is less than 95612). Euler's totient φ(95612) = 41600 numbers up to 95612 share no factor with it.
- 4
The digits of 95612 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95612 = 2^{2} \times 11 \times 41 \times 53 \]95612 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 190512 |
| Euler totient φ(n) | 41600 |
| Square | 9141654544 |
| Cube | 874051874260928 |
| Square root | 309.211901 (= 2√23903) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.5612 × |
95612 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand six hundred and twelve |
| Binary (base 2) | 10111010101111100 |
| Octal (base 8) | 272574 |
| Hexadecimal (base 16) | 1757C |
| Base 3 | 11212011012 |
| As time | 95612 seconds = 26 h 33 min 32 s |
Is 95612 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (95612 ÷ 2 = 47806) | 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 (95612 ÷ 4 = 23903) | 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 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 5) | 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 | Yes (95612 ÷ 11 = 8692) | 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 95612 a prime number?
No. 95612 = × 11 × 41 × 53, so it is divisible by 2.
What are the factors of 95612?
1, 2, 4, 11, 22, 41, 44, 53, 82, 106, 164, 212, 451, 583, 902, 1166, 1804, 2173, 2332, 4346, 8692, 23903, 47806, 95612.
What is 95612 in binary?
10111010101111100 (hexadecimal 1757C, octal 272574).
What is the square root of 95612?
About 309.2119, exactly 2√23903.
Is 95612 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 95612?
It is a composite number with 24 divisors.