The number 93436
93436 is a composite number with 24 divisors. Its prime factorisation is × 7 × 47 × 71. Divisors (24): 1, 2, 4, 7, 14, 28, 47, 71, 94, 142, 188, 284, 329, 497, 658, 994 … 93436.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93436 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93436 is composite. Its prime factorisation is
- 3
The divisors add up to 193536; without 93436 itself that is 100100, so 93436 is abundant (100100 is more than 93436). Euler's totient φ(93436) = 38640 numbers up to 93436 share no factor with it.
- 4
The digits of 93436 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93436 = 2^{2} \times 7 \times 47 \times 71 \]93436 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 193536 |
| Euler totient φ(n) | 38640 |
| Square | 8730286096 |
| Cube | 815723011665856 |
| Square root | 305.673028 (= 2√23359) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.3436 × |
93436 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand four hundred and thirty-six |
| Binary (base 2) | 10110110011111100 |
| Octal (base 8) | 266374 |
| Hexadecimal (base 16) | 16CFC |
| Base 3 | 11202011121 |
| As time | 93436 seconds = 25 h 57 min 16 s |
Is 93436 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (93436 ÷ 2 = 46718) | 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 | Yes (93436 ÷ 4 = 23359) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (93436 ÷ 7 = 13348) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93436 a prime number?
No. 93436 = × 7 × 47 × 71, so it is divisible by 2.
What are the factors of 93436?
1, 2, 4, 7, 14, 28, 47, 71, 94, 142, 188, 284, 329, 497, 658, 994, 1316, 1988, 3337, 6674, 13348, 23359, 46718, 93436.
What is 93436 in binary?
10110110011111100 (hexadecimal 16CFC, octal 266374).
What is the square root of 93436?
About 305.6730, exactly 2√23359.
Is 93436 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 93436?
It is a composite number with 24 divisors.