The number 27399
27399 is a composite number with 4 divisors. Its prime factorisation is 3 × 9133. Divisors (4): 1, 3, 9133, 27399.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27399: a semiprime: 3 × 9133, the product of two primes.
- 2
27399 is composite. Its prime factorisation is
- 3
The divisors add up to 36536; without 27399 itself that is 9137, so 27399 is deficient (9137 is less than 27399). Euler's totient φ(27399) = 18264 numbers up to 27399 share no factor with it.
- 4
The digits of 27399 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 139 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27399 = 3 \times 9133 \]
27399 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 36536 |
| Euler totient φ(n) | 18264 |
| Square | 750705201 |
| Cube | 20568571802199 |
| Square root | 165.526433 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 139 |
| Scientific notation | 2.7399 × |
27399 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand three hundred and ninety-nine |
| Binary (base 2) | 110101100000111 |
| Octal (base 8) | 65407 |
| Hexadecimal (base 16) | 6B07 |
| Base 3 | 1101120210 |
| As time | 27399 seconds = 7 h 36 min 39 s |
Is 27399 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 (27399 ÷ 3 = 9133) | 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 4) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 27399 a prime number?
No. 27399 = 3 × 9133, so it is divisible by 3.
What are the factors of 27399?
1, 3, 9133, 27399.
What is 27399 in binary?
110101100000111 (hexadecimal 6B07, octal 65407).
What is the square root of 27399?
About 165.5264.
Is 27399 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 27399?
27399 is a semiprime: 3 × 9133, the product of two primes.