The number 93674
93674 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 6691. Divisors (8): 1, 2, 7, 14, 6691, 13382, 46837, 93674.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93674 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93674 is composite. Its prime factorisation is
- 3
The divisors add up to 160608; without 93674 itself that is 66934, so 93674 is deficient (66934 is less than 93674). Euler's totient φ(93674) = 40140 numbers up to 93674 share no factor with it.
- 4
The digits of 93674 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93674 = 2 \times 7 \times 6691 \]
93674 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 160608 |
| Euler totient φ(n) | 40140 |
| Square | 8774818276 |
| Cube | 821972327186024 |
| Square root | 306.062085 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 177 |
| Scientific notation | 9.3674 × |
93674 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand six hundred and seventy-four |
| Binary (base 2) | 10110110111101010 |
| Octal (base 8) | 266752 |
| Hexadecimal (base 16) | 16DEA |
| Base 3 | 11202111102 |
| As time | 93674 seconds = 26 h 1 min 14 s |
Is 93674 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93674 ÷ 2 = 46837) | 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 | Yes (93674 ÷ 7 = 13382) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 9) | 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 93674 a prime number?
No. 93674 = 2 × 7 × 6691, so it is divisible by 2.
What are the factors of 93674?
1, 2, 7, 14, 6691, 13382, 46837, 93674.
What is 93674 in binary?
10110110111101010 (hexadecimal 16DEA, octal 266752).
What is the square root of 93674?
About 306.0621.
Is 93674 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 93674?
It is a composite number with 8 divisors.