The number 27469
27469 is a composite number with 4 divisors. Its prime factorisation is 13 × 2113. Divisors (4): 1, 13, 2113, 27469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27469: a semiprime: 13 × 2113, the product of two primes.
- 2
27469 is composite. Its prime factorisation is
- 3
The divisors add up to 29596; without 27469 itself that is 2127, so 27469 is deficient (2127 is less than 27469). Euler's totient φ(27469) = 25344 numbers up to 27469 share no factor with it.
- 4
The digits of 27469 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
\[ 27469 = 13 \times 2113 \]
27469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 29596 |
| Euler totient φ(n) | 25344 |
| Square | 754545961 |
| Cube | 20726623002709 |
| Square root | 165.737745 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 152 |
| Scientific notation | 2.7469 × |
27469 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand four hundred and sixty-nine |
| Binary (base 2) | 110101101001101 |
| Octal (base 8) | 65515 |
| Hexadecimal (base 16) | 6B4D |
| Base 3 | 1101200101 |
| As time | 27469 seconds = 7 h 37 min 49 s |
Is 27469 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 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 1) | 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27469 a prime number?
No. 27469 = 13 × 2113, so it is divisible by 13.
What are the factors of 27469?
1, 13, 2113, 27469.
What is 27469 in binary?
110101101001101 (hexadecimal 6B4D, octal 65515).
What is the square root of 27469?
About 165.7377.
Is 27469 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 27469?
27469 is a semiprime: 13 × 2113, the product of two primes.