The number 94694
94694 is a composite number with 8 divisors. Its prime factorisation is 2 × 113 × 419. Divisors (8): 1, 2, 113, 226, 419, 838, 47347, 94694.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 94694: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
94694 is composite. Its prime factorisation is
- 3
The divisors add up to 143640; without 94694 itself that is 48946, so 94694 is deficient (48946 is less than 94694). Euler's totient φ(94694) = 46816 numbers up to 94694 share no factor with it.
- 4
The digits of 94694 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94694 = 2 \times 113 \times 419 \]
94694 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 143640 |
| Euler totient φ(n) | 46816 |
| Square | 8966953636 |
| Cube | 849116707607384 |
| Square root | 307.723902 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.4694 × |
94694 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand six hundred and ninety-four |
| Binary (base 2) | 10111000111100110 |
| Octal (base 8) | 270746 |
| Hexadecimal (base 16) | 171E6 |
| Base 3 | 11210220012 |
| As time | 94694 seconds = 26 h 18 min 14 s |
Is 94694 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94694 ÷ 2 = 47347) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94694 a prime number?
No. 94694 = 2 × 113 × 419, so it is divisible by 2.
What are the factors of 94694?
1, 2, 113, 226, 419, 838, 47347, 94694.
What is 94694 in binary?
10111000111100110 (hexadecimal 171E6, octal 270746).
What is the square root of 94694?
About 307.7239.
Is 94694 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 94694?
94694 is a happy number: repeatedly adding the squares of its digits reaches 1.