The number 95823
95823 is a composite number with 30 divisors. Its prime factorisation is × 7 × . Divisors (30): 1, 3, 7, 9, 13, 21, 27, 39, 63, 81, 91, 117, 169, 189, 273, 351 … 95823.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95823: a Harshad number: divisible by its digit sum 27.
- 2
95823 is composite. Its prime factorisation is
- 3
The divisors add up to 177144; without 95823 itself that is 81321, so 95823 is deficient (81321 is less than 95823). Euler's totient φ(95823) = 50544 numbers up to 95823 share no factor with it.
- 4
The digits of 95823 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 190 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95823 = 3^{4} \times 7 \times 13^{2} \]95823 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 30 |
| Sum of divisors | 177144 |
| Euler totient φ(n) | 50544 |
| Square | 9182047329 |
| Cube | 879851321206767 |
| Square root | 309.552903 (= 117√7) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 190 |
| Scientific notation | 9.5823 × |
95823 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand eight hundred and twenty-three |
| Binary (base 2) | 10111011001001111 |
| Octal (base 8) | 273117 |
| Hexadecimal (base 16) | 1764F |
| Base 3 | 11212110000 |
| As time | 95823 seconds = 26 h 37 min 3 s |
Is 95823 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (95823 ÷ 3 = 31941) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (95823 ÷ 7 = 13689) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (95823 ÷ 9 = 10647) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95823 a prime number?
No. 95823 = × 7 × , so it is divisible by 3.
What are the factors of 95823?
1, 3, 7, 9, 13, 21, 27, 39, 63, 81, 91, 117, 169, 189, 273, 351, 507, 567, 819, 1053, 1183, 1521, 2457, 3549, 4563, 7371, 10647, 13689, 31941, 95823.
What is 95823 in binary?
10111011001001111 (hexadecimal 1764F, octal 273117).
What is the square root of 95823?
About 309.5529, exactly 117√7.
Is 95823 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 95823?
95823 is a Harshad number: divisible by its digit sum 27.