The number 27483
27483 is a composite number with 4 divisors. Its prime factorisation is 3 × 9161. Divisors (4): 1, 3, 9161, 27483.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27483: a semiprime: 3 × 9161, the product of two primes.
- 2
27483 is composite. Its prime factorisation is
- 3
The divisors add up to 36648; without 27483 itself that is 9165, so 27483 is deficient (9165 is less than 27483). Euler's totient φ(27483) = 18320 numbers up to 27483 share no factor with it.
- 4
The digits of 27483 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 196 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27483 = 3 \times 9161 \]
27483 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 36648 |
| Euler totient φ(n) | 18320 |
| Square | 755315289 |
| Cube | 20758330087587 |
| Square root | 165.779975 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 196 |
| Scientific notation | 2.7483 × |
27483 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand four hundred and eighty-three |
| Binary (base 2) | 110101101011011 |
| Octal (base 8) | 65533 |
| Hexadecimal (base 16) | 6B5B |
| Base 3 | 1101200220 |
| As time | 27483 seconds = 7 h 38 min 3 s |
Is 27483 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 (27483 ÷ 3 = 9161) | 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 1) | 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 5) | 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 27483 a prime number?
No. 27483 = 3 × 9161, so it is divisible by 3.
What are the factors of 27483?
1, 3, 9161, 27483.
What is 27483 in binary?
110101101011011 (hexadecimal 6B5B, octal 65533).
What is the square root of 27483?
About 165.7800.
Is 27483 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 27483?
27483 is a semiprime: 3 × 9161, the product of two primes.