The number 483
483 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 23. Divisors (8): 1, 3, 7, 21, 23, 69, 161, 483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
483 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
483 is composite. Its prime factorisation is
- 3
The divisors add up to 768; without 483 itself that is 285, so 483 is deficient (285 is less than 483). Euler's totient φ(483) = 264 numbers up to 483 share no factor with it.
- 4
The digits of 483 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 22 steps to reach 1.
LaTeX source of the formulas on this page
\[ 483 = 3 \times 7 \times 23 \]
483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 768 |
| Euler totient φ(n) | 264 |
| Square | 233289 |
| Cube | 112678587 |
| Square root | 21.977261 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 22 |
| Scientific notation | 4.83 × |
483 in other forms
| Form | Value |
|---|---|
| In words | four hundred and eighty-three |
| Roman numerals | CDLXXXIII |
| Binary (base 2) | 111100011 |
| Octal (base 8) | 743 |
| Hexadecimal (base 16) | 1E3 |
| Base 3 | 122220 |
| As time | 483 seconds = 8 min 3 s |
Is 483 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 (483 ÷ 3 = 161) | 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 | Yes (483 ÷ 7 = 69) | 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 10) | 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 483 a prime number?
No. 483 = 3 × 7 × 23, so it is divisible by 3.
What are the factors of 483?
1, 3, 7, 21, 23, 69, 161, 483.
What is 483 in binary?
111100011 (hexadecimal 1E3, octal 743).
What is the square root of 483?
About 21.9773.
What is 483 in Roman numerals?
CDLXXXIII.
Is 483 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 483?
It is a composite number with 8 divisors.