The number 94801
94801 is a composite number with 8 divisors. Its prime factorisation is 7 × 29 × 467. Divisors (8): 1, 7, 29, 203, 467, 3269, 13543, 94801.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94801 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94801 is composite. Its prime factorisation is
- 3
The divisors add up to 112320; without 94801 itself that is 17519, so 94801 is deficient (17519 is less than 94801). Euler's totient φ(94801) = 78288 numbers up to 94801 share no factor with it.
- 4
The digits of 94801 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 76 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94801 = 7 \times 29 \times 467 \]
94801 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 112320 |
| Euler totient φ(n) | 78288 |
| Square | 8987229601 |
| Cube | 851998353404401 |
| Square root | 307.897710 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 76 |
| Scientific notation | 9.4801 × |
94801 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand eight hundred and one |
| Binary (base 2) | 10111001001010001 |
| Octal (base 8) | 271121 |
| Hexadecimal (base 16) | 17251 |
| Base 3 | 11211001011 |
| As time | 94801 seconds = 26 h 20 min 1 s |
Is 94801 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 | Yes (94801 ÷ 7 = 13543) | 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 3) | 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 94801 a prime number?
No. 94801 = 7 × 29 × 467, so it is divisible by 7.
What are the factors of 94801?
1, 7, 29, 203, 467, 3269, 13543, 94801.
What is 94801 in binary?
10111001001010001 (hexadecimal 17251, octal 271121).
What is the square root of 94801?
About 307.8977.
Is 94801 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 94801?
It is a composite number with 8 divisors.