The number 10483
10483 is a composite number with 4 divisors. Its prime factorisation is 11 × 953. Divisors (4): 1, 11, 953, 10483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10483: a semiprime: 11 × 953, the product of two primes.
- 2
10483 is composite. Its prime factorisation is
- 3
The divisors add up to 11448; without 10483 itself that is 965, so 10483 is deficient (965 is less than 10483). Euler's totient φ(10483) = 9520 numbers up to 10483 share no factor with it.
- 4
The digits of 10483 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10483 = 11 \times 953 \]
10483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11448 |
| Euler totient φ(n) | 9520 |
| Square | 109893289 |
| Cube | 1152011348587 |
| Square root | 102.386523 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 86 |
| Scientific notation | 1.0483 × |
10483 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and eighty-three |
| Binary (base 2) | 10100011110011 |
| Octal (base 8) | 24363 |
| Hexadecimal (base 16) | 28F3 |
| Base 3 | 112101021 |
| As time | 10483 seconds = 2 h 54 min 43 s |
Is 10483 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 1) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 (10483 ÷ 11 = 953) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10483 a prime number?
No. 10483 = 11 × 953, so it is divisible by 11.
What are the factors of 10483?
1, 11, 953, 10483.
What is 10483 in binary?
10100011110011 (hexadecimal 28F3, octal 24363).
What is the square root of 10483?
About 102.3865.
Is 10483 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 10483?
10483 is a semiprime: 11 × 953, the product of two primes.