The number 94501
94501 is a composite number with 8 divisors. Its prime factorisation is Ć 71. Divisors (8): 1, 11, 71, 121, 781, 1331, 8591, 94501.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94501 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94501 is composite. Its prime factorisation is
- 3
The divisors add up to 105408; without 94501 itself that is 10907, so 94501 is deficient (10907 is less than 94501). Euler's totient Ļ(94501) = 84700 numbers up to 94501 share no factor with it.
- 4
The digits of 94501 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94501 = 11^{3} \times 71 \]94501 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 105408 |
| Euler totient Ļ(n) | 84700 |
| Square | 8930439001 |
| Cube | 843935416033501 |
| Square root | 307.410149 (= 11ā781) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.4501 Ć |
94501 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand five hundred and one |
| Binary (base 2) | 10111000100100101 |
| Octal (base 8) | 270445 |
| Hexadecimal (base 16) | 17125 |
| Base 3 | 11210122001 |
| As time | 94501 seconds = 26 h 15 min 1 s |
Is 94501 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 5) | 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 | Yes (94501 Ć· 11 = 8591) | 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 94501 a prime number?
No. 94501 = Ć 71, so it is divisible by 11.
What are the factors of 94501?
1, 11, 71, 121, 781, 1331, 8591, 94501.
What is 94501 in binary?
10111000100100101 (hexadecimal 17125, octal 270445).
What is the square root of 94501?
About 307.4101, exactly 11ā781.
Is 94501 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 94501?
It is a composite number with 8 divisors.