The number 94692
94692 is a composite number with 24 divisors. Its prime factorisation is × 3 × 13 × 607. Divisors (24): 1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 156, 607, 1214, 1821, 2428 … 94692.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94692 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94692 is composite. Its prime factorisation is
- 3
The divisors add up to 238336; without 94692 itself that is 143644, so 94692 is abundant (143644 is more than 94692). Euler's totient φ(94692) = 29088 numbers up to 94692 share no factor with it.
- 4
The digits of 94692 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94692 = 2^{2} \times 3 \times 13 \times 607 \]94692 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 238336 |
| Euler totient φ(n) | 29088 |
| Square | 8966574864 |
| Cube | 849062907021888 |
| Square root | 307.720653 (= 2√23673) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.4692 × |
94692 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand six hundred and ninety-two |
| Binary (base 2) | 10111000111100100 |
| Octal (base 8) | 270744 |
| Hexadecimal (base 16) | 171E4 |
| Base 3 | 11210220010 |
| As time | 94692 seconds = 26 h 18 min 12 s |
Is 94692 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94692 ÷ 2 = 47346) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (94692 ÷ 3 = 31564) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (94692 ÷ 4 = 23673) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (94692 ÷ 6 = 15782) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (94692 ÷ 12 = 7891) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 94692 a prime number?
No. 94692 = × 3 × 13 × 607, so it is divisible by 2.
What are the factors of 94692?
1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 156, 607, 1214, 1821, 2428, 3642, 7284, 7891, 15782, 23673, 31564, 47346, 94692.
What is 94692 in binary?
10111000111100100 (hexadecimal 171E4, octal 270744).
What is the square root of 94692?
About 307.7207, exactly 2√23673.
Is 94692 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 94692?
It is a composite number with 24 divisors.