The number 27496
27496 is a composite number with 16 divisors. Its prime factorisation is × 7 × 491. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 491, 982, 1964, 3437, 3928, 6874, 13748, 27496.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27496: a Harshad number: divisible by its digit sum 28.
- 2
27496 is composite. Its prime factorisation is
- 3
The divisors add up to 59040; without 27496 itself that is 31544, so 27496 is abundant (31544 is more than 27496). Euler's totient φ(27496) = 11760 numbers up to 27496 share no factor with it.
- 4
The digits of 27496 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 152 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27496 = 2^{3} \times 7 \times 491 \]27496 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 59040 |
| Euler totient φ(n) | 11760 |
| Square | 756030016 |
| Cube | 20787801319936 |
| Square root | 165.819179 (= 2√6874) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 152 |
| Scientific notation | 2.7496 × |
27496 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand four hundred and ninety-six |
| Binary (base 2) | 110101101101000 |
| Octal (base 8) | 65550 |
| Hexadecimal (base 16) | 6B68 |
| Base 3 | 1101201101 |
| As time | 27496 seconds = 7 h 38 min 16 s |
Is 27496 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (27496 ÷ 2 = 13748) | 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 (27496 ÷ 4 = 6874) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 (27496 ÷ 7 = 3928) | 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 | Yes (27496 ÷ 8 = 3437) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 27496 a prime number?
No. 27496 = × 7 × 491, so it is divisible by 2.
What are the factors of 27496?
1, 2, 4, 7, 8, 14, 28, 56, 491, 982, 1964, 3437, 3928, 6874, 13748, 27496.
What is 27496 in binary?
110101101101000 (hexadecimal 6B68, octal 65550).
What is the square root of 27496?
About 165.8192, exactly 2√6874.
Is 27496 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 27496?
27496 is a Harshad number: divisible by its digit sum 28.