The number 95493
95493 is a composite number with 8 divisors. Its prime factorisation is 3 × 139 × 229. Divisors (8): 1, 3, 139, 229, 417, 687, 31831, 95493.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
95493 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
95493 is composite. Its prime factorisation is
- 3
The divisors add up to 128800; without 95493 itself that is 33307, so 95493 is deficient (33307 is less than 95493). Euler's totient φ(95493) = 62928 numbers up to 95493 share no factor with it.
- 4
The digits of 95493 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 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95493 = 3 \times 139 \times 229 \]
95493 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 128800 |
| Euler totient φ(n) | 62928 |
| Square | 9118913049 |
| Cube | 870792363788157 |
| Square root | 309.019417 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 97 |
| Scientific notation | 9.5493 × |
95493 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand four hundred and ninety-three |
| Binary (base 2) | 10111010100000101 |
| Octal (base 8) | 272405 |
| Hexadecimal (base 16) | 17505 |
| Base 3 | 11211222210 |
| As time | 95493 seconds = 26 h 31 min 33 s |
Is 95493 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 (95493 ÷ 3 = 31831) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 | 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 5) | 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 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 95493 a prime number?
No. 95493 = 3 × 139 × 229, so it is divisible by 3.
What are the factors of 95493?
1, 3, 139, 229, 417, 687, 31831, 95493.
What is 95493 in binary?
10111010100000101 (hexadecimal 17505, octal 272405).
What is the square root of 95493?
About 309.0194.
Is 95493 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 95493?
It is a composite number with 8 divisors.