The number 93209
93209 is a composite number with 4 divisors. Its prime factorisation is 83 × 1123. Divisors (4): 1, 83, 1123, 93209.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 93209: a semiprime: 83 × 1123, the product of two primes.
- 2
93209 is composite. Its prime factorisation is
- 3
The divisors add up to 94416; without 93209 itself that is 1207, so 93209 is deficient (1207 is less than 93209). Euler's totient φ(93209) = 92004 numbers up to 93209 share no factor with it.
- 4
The digits of 93209 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93209 = 83 \times 1123 \]
93209 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 94416 |
| Euler totient φ(n) | 92004 |
| Square | 8687917681 |
| Cube | 809792119128329 |
| Square root | 305.301490 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 115 |
| Scientific notation | 9.3209 × |
93209 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand two hundred and nine |
| Binary (base 2) | 10110110000011001 |
| Octal (base 8) | 266031 |
| Hexadecimal (base 16) | 16C19 |
| Base 3 | 11201212012 |
| As time | 93209 seconds = 25 h 53 min 29 s |
Is 93209 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 2) | 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 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 1) | 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 9) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93209 a prime number?
No. 93209 = 83 × 1123, so it is divisible by 83.
What are the factors of 93209?
1, 83, 1123, 93209.
What is 93209 in binary?
10110110000011001 (hexadecimal 16C19, octal 266031).
What is the square root of 93209?
About 305.3015.
Is 93209 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 93209?
93209 is a semiprime: 83 × 1123, the product of two primes.