The number 95391
95391 is a composite number with 8 divisors. Its prime factorisation is × 3533. Divisors (8): 1, 3, 9, 27, 3533, 10599, 31797, 95391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95391: a Harshad number: divisible by its digit sum 27.
- 2
95391 is composite. Its prime factorisation is
- 3
The divisors add up to 141360; without 95391 itself that is 45969, so 95391 is deficient (45969 is less than 95391). Euler's totient φ(95391) = 63576 numbers up to 95391 share no factor with it.
- 4
The digits of 95391 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 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95391 = 3^{3} \times 3533 \]95391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 141360 |
| Euler totient φ(n) | 63576 |
| Square | 9099442881 |
| Cube | 868004955861471 |
| Square root | 308.854335 (= 3√10599) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.5391 × |
95391 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand three hundred and ninety-one |
| Binary (base 2) | 10111010010011111 |
| Octal (base 8) | 272237 |
| Hexadecimal (base 16) | 1749F |
| Base 3 | 11211212000 |
| As time | 95391 seconds = 26 h 29 min 51 s |
Is 95391 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 (95391 ÷ 3 = 31797) | 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 1) | 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 | No (remainder 2) | 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 (95391 ÷ 9 = 10599) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95391 a prime number?
No. 95391 = × 3533, so it is divisible by 3.
What are the factors of 95391?
1, 3, 9, 27, 3533, 10599, 31797, 95391.
What is 95391 in binary?
10111010010011111 (hexadecimal 1749F, octal 272237).
What is the square root of 95391?
About 308.8543, exactly 3√10599.
Is 95391 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 95391?
95391 is a Harshad number: divisible by its digit sum 27.