The number 7483
7483 is a composite number with 4 divisors. Its prime factorisation is 7 × 1069. Divisors (4): 1, 7, 1069, 7483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 7483: a semiprime: 7 × 1069, the product of two primes.
- 2
7483 is composite. Its prime factorisation is
- 3
The divisors add up to 8560; without 7483 itself that is 1077, so 7483 is deficient (1077 is less than 7483). Euler's totient φ(7483) = 6408 numbers up to 7483 share no factor with it.
- 4
The digits of 7483 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 7483 = 7 \times 1069 \]
7483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 8560 |
| Euler totient φ(n) | 6408 |
| Square | 55995289 |
| Cube | 419012747587 |
| Square root | 86.504335 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 39 |
| Scientific notation | 7.483 × |
7483 in other forms
| Form | Value |
|---|---|
| In words | seven thousand four hundred and eighty-three |
| Binary (base 2) | 1110100111011 |
| Octal (base 8) | 16473 |
| Hexadecimal (base 16) | 1D3B |
| Base 3 | 101021011 |
| As time | 7483 seconds = 2 h 4 min 43 s |
Is 7483 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 | Yes (7483 ÷ 7 = 1069) | 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 4) | 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 3) | 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 7483 a prime number?
No. 7483 = 7 × 1069, so it is divisible by 7.
What are the factors of 7483?
1, 7, 1069, 7483.
What is 7483 in binary?
1110100111011 (hexadecimal 1D3B, octal 16473).
What is the square root of 7483?
About 86.5043.
Is 7483 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 7483?
7483 is a semiprime: 7 × 1069, the product of two primes.