The number 27748
27748 is a composite number with 12 divisors. Its prime factorisation is × 7 × 991. Divisors (12): 1, 2, 4, 7, 14, 28, 991, 1982, 3964, 6937, 13874, 27748.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27748: a Harshad number: divisible by its digit sum 28.
- 2
27748 is composite. Its prime factorisation is
- 3
The divisors add up to 55552; without 27748 itself that is 27804, so 27748 is abundant (27804 is more than 27748). Euler's totient φ(27748) = 11880 numbers up to 27748 share no factor with it.
- 4
The digits of 27748 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 183 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27748 = 2^{2} \times 7 \times 991 \]27748 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 55552 |
| Euler totient φ(n) | 11880 |
| Square | 769951504 |
| Cube | 21364614332992 |
| Square root | 166.577309 (= 2√6937) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 183 |
| Scientific notation | 2.7748 × |
27748 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand seven hundred and forty-eight |
| Binary (base 2) | 110110001100100 |
| Octal (base 8) | 66144 |
| Hexadecimal (base 16) | 6C64 |
| Base 3 | 1102001201 |
| As time | 27748 seconds = 7 h 42 min 28 s |
Is 27748 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (27748 ÷ 2 = 13874) | 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 | Yes (27748 ÷ 4 = 6937) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (27748 ÷ 7 = 3964) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27748 a prime number?
No. 27748 = × 7 × 991, so it is divisible by 2.
What are the factors of 27748?
1, 2, 4, 7, 14, 28, 991, 1982, 3964, 6937, 13874, 27748.
What is 27748 in binary?
110110001100100 (hexadecimal 6C64, octal 66144).
What is the square root of 27748?
About 166.5773, exactly 2√6937.
Is 27748 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 27748?
27748 is a Harshad number: divisible by its digit sum 28.