The number 94681
94681 is a composite number with 4 divisors. Its prime factorisation is 73 × 1297. Divisors (4): 1, 73, 1297, 94681.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94681: a semiprime: 73 × 1297, the product of two primes.
- 2
94681 is composite. Its prime factorisation is
- 3
The divisors add up to 96052; without 94681 itself that is 1371, so 94681 is deficient (1371 is less than 94681). Euler's totient φ(94681) = 93312 numbers up to 94681 share no factor with it.
- 4
The digits of 94681 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94681 = 73 \times 1297 \]
94681 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 96052 |
| Euler totient φ(n) | 93312 |
| Square | 8964491761 |
| Cube | 848767044423241 |
| Square root | 307.702779 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.4681 × |
94681 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand six hundred and eighty-one |
| Binary (base 2) | 10111000111011001 |
| Octal (base 8) | 270731 |
| Hexadecimal (base 16) | 171D9 |
| Base 3 | 11210212201 |
| As time | 94681 seconds = 26 h 18 min 1 s |
Is 94681 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 1) | 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 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 94681 a prime number?
No. 94681 = 73 × 1297, so it is divisible by 73.
What are the factors of 94681?
1, 73, 1297, 94681.
What is 94681 in binary?
10111000111011001 (hexadecimal 171D9, octal 270731).
What is the square root of 94681?
About 307.7028.
Is 94681 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 94681?
94681 is a semiprime: 73 × 1297, the product of two primes.