The number 93713
93713 is a composite number with 4 divisors. Its prime factorisation is 31 × 3023. Divisors (4): 1, 31, 3023, 93713.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93713: a semiprime: 31 × 3023, the product of two primes.
- 2
93713 is composite. Its prime factorisation is
- 3
The divisors add up to 96768; without 93713 itself that is 3055, so 93713 is deficient (3055 is less than 93713). Euler's totient φ(93713) = 90660 numbers up to 93713 share no factor with it.
- 4
The digits of 93713 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93713 = 31 \times 3023 \]
93713 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96768 |
| Euler totient φ(n) | 90660 |
| Square | 8782126369 |
| Cube | 822999408418097 |
| Square root | 306.125791 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.3713 × |
93713 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand seven hundred and thirteen |
| Binary (base 2) | 10110111000010001 |
| Octal (base 8) | 267021 |
| Hexadecimal (base 16) | 16E11 |
| Base 3 | 11202112212 |
| As time | 93713 seconds = 26 h 1 min 53 s |
Is 93713 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 5) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93713 a prime number?
No. 93713 = 31 × 3023, so it is divisible by 31.
What are the factors of 93713?
1, 31, 3023, 93713.
What is 93713 in binary?
10110111000010001 (hexadecimal 16E11, octal 267021).
What is the square root of 93713?
About 306.1258.
Is 93713 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 93713?
93713 is a semiprime: 31 × 3023, the product of two primes.