The number 39483
39483 is a composite number with 12 divisors. Its prime factorisation is × 41 × 107. Divisors (12): 1, 3, 9, 41, 107, 123, 321, 369, 963, 4387, 13161, 39483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
39483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
39483 is composite. Its prime factorisation is
- 3
The divisors add up to 58968; without 39483 itself that is 19485, so 39483 is deficient (19485 is less than 39483). Euler's totient φ(39483) = 25440 numbers up to 39483 share no factor with it.
- 4
The digits of 39483 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 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39483 = 3^{2} \times 41 \times 107 \]39483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 58968 |
| Euler totient φ(n) | 25440 |
| Square | 1558907289 |
| Cube | 61550336491587 |
| Square root | 198.703296 (= 3√4387) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 75 |
| Scientific notation | 3.9483 × |
39483 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand four hundred and eighty-three |
| Binary (base 2) | 1001101000111011 |
| Octal (base 8) | 115073 |
| Hexadecimal (base 16) | 9A3B |
| Base 3 | 2000011100 |
| As time | 39483 seconds = 10 h 58 min 3 s |
Is 39483 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 (39483 ÷ 3 = 13161) | 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 3) | 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 (39483 ÷ 9 = 4387) | 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 4) | 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 39483 a prime number?
No. 39483 = × 41 × 107, so it is divisible by 3.
What are the factors of 39483?
1, 3, 9, 41, 107, 123, 321, 369, 963, 4387, 13161, 39483.
What is 39483 in binary?
1001101000111011 (hexadecimal 9A3B, octal 115073).
What is the square root of 39483?
About 198.7033, exactly 3√4387.
Is 39483 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 39483?
It is a composite number with 12 divisors.