The number 94891
94891 is a composite number with 4 divisors. Its prime factorisation is 31 × 3061. Divisors (4): 1, 31, 3061, 94891.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94891: a Harshad number: divisible by its digit sum 31; a semiprime: 31 × 3061, the product of two primes.
- 2
94891 is composite. Its prime factorisation is
- 3
The divisors add up to 97984; without 94891 itself that is 3093, so 94891 is deficient (3093 is less than 94891). Euler's totient φ(94891) = 91800 numbers up to 94891 share no factor with it.
- 4
The digits of 94891 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94891 = 31 \times 3061 \]
94891 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 97984 |
| Euler totient φ(n) | 91800 |
| Square | 9004301881 |
| Cube | 854427209789971 |
| Square root | 308.043828 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 76 |
| Scientific notation | 9.4891 × |
94891 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand eight hundred and ninety-one |
| Binary (base 2) | 10111001010101011 |
| Octal (base 8) | 271253 |
| Hexadecimal (base 16) | 172AB |
| Base 3 | 11211011111 |
| As time | 94891 seconds = 26 h 21 min 31 s |
Is 94891 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 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94891 a prime number?
No. 94891 = 31 × 3061, so it is divisible by 31.
What are the factors of 94891?
1, 31, 3061, 94891.
What is 94891 in binary?
10111001010101011 (hexadecimal 172AB, octal 271253).
What is the square root of 94891?
About 308.0438.
Is 94891 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 94891?
94891 is a Harshad number: divisible by its digit sum 31; a semiprime: 31 × 3061, the product of two primes.