The number 32483
32483 is a composite number with 4 divisors. Its prime factorisation is 11 × 2953. Divisors (4): 1, 11, 2953, 32483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32483: a semiprime: 11 × 2953, the product of two primes.
- 2
32483 is composite. Its prime factorisation is
- 3
The divisors add up to 35448; without 32483 itself that is 2965, so 32483 is deficient (2965 is less than 32483). Euler's totient φ(32483) = 29520 numbers up to 32483 share no factor with it.
- 4
The digits of 32483 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32483 = 11 \times 2953 \]
32483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 35448 |
| Euler totient φ(n) | 29520 |
| Square | 1055145289 |
| Cube | 34274284422587 |
| Square root | 180.230408 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 41 |
| Scientific notation | 3.2483 × |
32483 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand four hundred and eighty-three |
| Binary (base 2) | 111111011100011 |
| Octal (base 8) | 77343 |
| Hexadecimal (base 16) | 7EE3 |
| Base 3 | 1122120002 |
| As time | 32483 seconds = 9 h 1 min 23 s |
Is 32483 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 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 5) | 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 | No (remainder 2) | 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 | Yes (32483 ÷ 11 = 2953) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32483 a prime number?
No. 32483 = 11 × 2953, so it is divisible by 11.
What are the factors of 32483?
1, 11, 2953, 32483.
What is 32483 in binary?
111111011100011 (hexadecimal 7EE3, octal 77343).
What is the square root of 32483?
About 180.2304.
Is 32483 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 32483?
32483 is a semiprime: 11 × 2953, the product of two primes.