The number 27461
27461 is a composite number with 4 divisors. Its prime factorisation is 7 × 3923. Divisors (4): 1, 7, 3923, 27461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 27461: a semiprime: 7 × 3923, the product of two primes.
- 2
27461 is composite. Its prime factorisation is
- 3
The divisors add up to 31392; without 27461 itself that is 3931, so 27461 is deficient (3931 is less than 27461). Euler's totient φ(27461) = 23532 numbers up to 27461 share no factor with it.
- 4
The digits of 27461 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 152 steps to reach 1.
LaTeX source of the formulas on this page
\[ 27461 = 7 \times 3923 \]
27461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 31392 |
| Euler totient φ(n) | 23532 |
| Square | 754106521 |
| Cube | 20708519173181 |
| Square root | 165.713608 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 152 |
| Scientific notation | 2.7461 × |
27461 in other forms
| Form | Value |
|---|---|
| In words | twenty-seven thousand four hundred and sixty-one |
| Binary (base 2) | 110101101000101 |
| Octal (base 8) | 65505 |
| Hexadecimal (base 16) | 6B45 |
| Base 3 | 1101200002 |
| As time | 27461 seconds = 7 h 37 min 41 s |
Is 27461 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (27461 ÷ 7 = 3923) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 27461 a prime number?
No. 27461 = 7 × 3923, so it is divisible by 7.
What are the factors of 27461?
1, 7, 3923, 27461.
What is 27461 in binary?
110101101000101 (hexadecimal 6B45, octal 65505).
What is the square root of 27461?
About 165.7136.
Is 27461 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 27461?
27461 is a semiprime: 7 × 3923, the product of two primes.