The number 27598
27598 is a composite number with 4 divisors. Its prime factorisation is 2 × 13799. Divisors (4): 1, 2, 13799, 27598.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27598: a semiprime: 2 × 13799, the product of two primes.
- 2
27598 is composite. Its prime factorisation is
- 3
The divisors add up to 41400; without 27598 itself that is 13802, so 27598 is deficient (13802 is less than 27598). Euler's totient φ(27598) = 13798 numbers up to 27598 share no factor with it.
- 4
The digits of 27598 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27598 = 2 \times 13799 \]
27598 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 41400 |
| Euler totient φ(n) | 13798 |
| Square | 761649604 |
| Cube | 21020005771192 |
| Square root | 166.126458 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 64 |
| Scientific notation | 2.7598 × |
27598 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand five hundred and ninety-eight |
| Binary (base 2) | 110101111001110 |
| Octal (base 8) | 65716 |
| Hexadecimal (base 16) | 6BCE |
| Base 3 | 1101212011 |
| As time | 27598 seconds = 7 h 39 min 58 s |
Is 27598 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (27598 ÷ 2 = 13799) | 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 2) | 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 | No (remainder 4) | 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 6) | 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 8) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27598 a prime number?
No. 27598 = 2 × 13799, so it is divisible by 2.
What are the factors of 27598?
1, 2, 13799, 27598.
What is 27598 in binary?
110101111001110 (hexadecimal 6BCE, octal 65716).
What is the square root of 27598?
About 166.1265.
Is 27598 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 27598?
27598 is a semiprime: 2 × 13799, the product of two primes.