The number 94313
94313 is a composite number with 4 divisors. Its prime factorisation is 37 × 2549. Divisors (4): 1, 37, 2549, 94313.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94313: a semiprime: 37 × 2549, the product of two primes.
- 2
94313 is composite. Its prime factorisation is
- 3
The divisors add up to 96900; without 94313 itself that is 2587, so 94313 is deficient (2587 is less than 94313). Euler's totient φ(94313) = 91728 numbers up to 94313 share no factor with it.
- 4
The digits of 94313 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94313 = 37 \times 2549 \]
94313 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96900 |
| Euler totient φ(n) | 91728 |
| Square | 8894941969 |
| Cube | 838908661922297 |
| Square root | 307.104217 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 146 |
| Scientific notation | 9.4313 × |
94313 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand three hundred and thirteen |
| Binary (base 2) | 10111000001101001 |
| Octal (base 8) | 270151 |
| Hexadecimal (base 16) | 17069 |
| Base 3 | 11210101002 |
| As time | 94313 seconds = 26 h 11 min 53 s |
Is 94313 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 10) | 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 94313 a prime number?
No. 94313 = 37 × 2549, so it is divisible by 37.
What are the factors of 94313?
1, 37, 2549, 94313.
What is 94313 in binary?
10111000001101001 (hexadecimal 17069, octal 270151).
What is the square root of 94313?
About 307.1042.
Is 94313 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 94313?
94313 is a semiprime: 37 × 2549, the product of two primes.