The number 94813
94813 is a composite number with 4 divisors. Its prime factorisation is 59 × 1607. Divisors (4): 1, 59, 1607, 94813.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94813: a semiprime: 59 × 1607, the product of two primes.
- 2
94813 is composite. Its prime factorisation is
- 3
The divisors add up to 96480; without 94813 itself that is 1667, so 94813 is deficient (1667 is less than 94813). Euler's totient φ(94813) = 93148 numbers up to 94813 share no factor with it.
- 4
The digits of 94813 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94813 = 59 \times 1607 \]
94813 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96480 |
| Euler totient φ(n) | 93148 |
| Square | 8989504969 |
| Cube | 852321934625797 |
| Square root | 307.917197 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 40 |
| Scientific notation | 9.4813 × |
94813 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand eight hundred and thirteen |
| Binary (base 2) | 10111001001011101 |
| Octal (base 8) | 271135 |
| Hexadecimal (base 16) | 1725D |
| Base 3 | 11211001121 |
| As time | 94813 seconds = 26 h 20 min 13 s |
Is 94813 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 7) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94813 a prime number?
No. 94813 = 59 × 1607, so it is divisible by 59.
What are the factors of 94813?
1, 59, 1607, 94813.
What is 94813 in binary?
10111001001011101 (hexadecimal 1725D, octal 271135).
What is the square root of 94813?
About 307.9172.
Is 94813 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 94813?
94813 is a semiprime: 59 × 1607, the product of two primes.