The number 9483
9483 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 109. Divisors (8): 1, 3, 29, 87, 109, 327, 3161, 9483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9483 is composite. Its prime factorisation is
- 3
The divisors add up to 13200; without 9483 itself that is 3717, so 9483 is deficient (3717 is less than 9483). Euler's totient φ(9483) = 6048 numbers up to 9483 share no factor with it.
- 4
The digits of 9483 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9483 = 3 \times 29 \times 109 \]
9483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 13200 |
| Euler totient φ(n) | 6048 |
| Square | 89927289 |
| Cube | 852780481587 |
| Square root | 97.380696 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 52 |
| Scientific notation | 9.483 × |
9483 in other forms
| Form | Value |
|---|---|
| In words | nine thousand four hundred and eighty-three |
| Binary (base 2) | 10010100001011 |
| Octal (base 8) | 22413 |
| Hexadecimal (base 16) | 250B |
| Base 3 | 111000020 |
| As time | 9483 seconds = 2 h 38 min 3 s |
Is 9483 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 (9483 ÷ 3 = 3161) | 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 | No (remainder 6) | 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 1) | 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 9483 a prime number?
No. 9483 = 3 × 29 × 109, so it is divisible by 3.
What are the factors of 9483?
1, 3, 29, 87, 109, 327, 3161, 9483.
What is 9483 in binary?
10010100001011 (hexadecimal 250B, octal 22413).
What is the square root of 9483?
About 97.3807.
Is 9483 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 9483?
It is a composite number with 8 divisors.