The number 95313
95313 is a composite number with 4 divisors. Its prime factorisation is 3 × 31771. Divisors (4): 1, 3, 31771, 95313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 95313: a semiprime: 3 × 31771, the product of two primes.
- 2
95313 is composite. Its prime factorisation is
- 3
The divisors add up to 127088; without 95313 itself that is 31775, so 95313 is deficient (31775 is less than 95313). Euler's totient φ(95313) = 63540 numbers up to 95313 share no factor with it.
- 4
The digits of 95313 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 95313 = 3 \times 31771 \]
95313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 127088 |
| Euler totient φ(n) | 63540 |
| Square | 9084567969 |
| Cube | 865877426829297 |
| Square root | 308.728036 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.5313 × |
95313 in other forms
| Form | Value |
|---|---|
| In words | ninety-five thousand three hundred and thirteen |
| Binary (base 2) | 10111010001010001 |
| Octal (base 8) | 272121 |
| Hexadecimal (base 16) | 17451 |
| Base 3 | 11211202010 |
| As time | 95313 seconds = 26 h 28 min 33 s |
Is 95313 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 (95313 ÷ 3 = 31771) | 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 1) | 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 1) | 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 9) | 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 95313 a prime number?
No. 95313 = 3 × 31771, so it is divisible by 3.
What are the factors of 95313?
1, 3, 31771, 95313.
What is 95313 in binary?
10111010001010001 (hexadecimal 17451, octal 272121).
What is the square root of 95313?
About 308.7280.
Is 95313 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 95313?
95313 is a semiprime: 3 × 31771, the product of two primes.