The number 94081
94081 is a composite number with 4 divisors. Its prime factorisation is 13 × 7237. Divisors (4): 1, 13, 7237, 94081.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94081: a semiprime: 13 × 7237, the product of two primes.
- 2
94081 is composite. Its prime factorisation is
- 3
The divisors add up to 101332; without 94081 itself that is 7251, so 94081 is deficient (7251 is less than 94081). Euler's totient φ(94081) = 86832 numbers up to 94081 share no factor with it.
- 4
The digits of 94081 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94081 = 13 \times 7237 \]
94081 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 101332 |
| Euler totient φ(n) | 86832 |
| Square | 8851234561 |
| Cube | 832732998733441 |
| Square root | 306.726262 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 128 |
| Scientific notation | 9.4081 × |
94081 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and eighty-one |
| Binary (base 2) | 10110111110000001 |
| Octal (base 8) | 267601 |
| Hexadecimal (base 16) | 16F81 |
| Base 3 | 11210001111 |
| As time | 94081 seconds = 26 h 8 min 1 s |
Is 94081 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 1) | 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 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 9) | 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 94081 a prime number?
No. 94081 = 13 × 7237, so it is divisible by 13.
What are the factors of 94081?
1, 13, 7237, 94081.
What is 94081 in binary?
10110111110000001 (hexadecimal 16F81, octal 267601).
What is the square root of 94081?
About 306.7263.
Is 94081 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 94081?
94081 is a semiprime: 13 × 7237, the product of two primes.