The number 93483
93483 is a composite number with 24 divisors. Its prime factorisation is × 13 × 17 × 47. Divisors (24): 1, 3, 9, 13, 17, 39, 47, 51, 117, 141, 153, 221, 423, 611, 663, 799 … 93483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
93483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
93483 is composite. Its prime factorisation is
- 3
The divisors add up to 157248; without 93483 itself that is 63765, so 93483 is deficient (63765 is less than 93483). Euler's totient φ(93483) = 52992 numbers up to 93483 share no factor with it.
- 4
The digits of 93483 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 93483 = 3^{2} \times 13 \times 17 \times 47 \]93483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 157248 |
| Euler totient φ(n) | 52992 |
| Square | 8739071289 |
| Cube | 816954601309587 |
| Square root | 305.749898 (= 3√10387) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 107 |
| Scientific notation | 9.3483 × |
93483 in other forms
| Form | Value |
|---|---|
| In words | ninety-three thousand four hundred and eighty-three |
| Binary (base 2) | 10110110100101011 |
| Octal (base 8) | 266453 |
| Hexadecimal (base 16) | 16D2B |
| Base 3 | 11202020100 |
| As time | 93483 seconds = 25 h 58 min 3 s |
Is 93483 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 | Yes (93483 ÷ 3 = 31161) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (93483 ÷ 9 = 10387) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 93483 a prime number?
No. 93483 = × 13 × 17 × 47, so it is divisible by 3.
What are the factors of 93483?
1, 3, 9, 13, 17, 39, 47, 51, 117, 141, 153, 221, 423, 611, 663, 799, 1833, 1989, 2397, 5499, 7191, 10387, 31161, 93483.
What is 93483 in binary?
10110110100101011 (hexadecimal 16D2B, octal 266453).
What is the square root of 93483?
About 305.7499, exactly 3√10387.
Is 93483 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 93483?
It is a composite number with 24 divisors.