The number 11461
11461 is a composite number with 4 divisors. Its prime factorisation is 73 × 157. Divisors (4): 1, 73, 157, 11461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11461: a semiprime: 73 × 157, the product of two primes.
- 2
11461 is composite. Its prime factorisation is
- 3
The divisors add up to 11692; without 11461 itself that is 231, so 11461 is deficient (231 is less than 11461). Euler's totient φ(11461) = 11232 numbers up to 11461 share no factor with it.
- 4
The digits of 11461 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11461 = 73 \times 157 \]
11461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11692 |
| Euler totient φ(n) | 11232 |
| Square | 131354521 |
| Cube | 1505454165181 |
| Square root | 107.056060 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.1461 × |
11461 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and sixty-one |
| Binary (base 2) | 10110011000101 |
| Octal (base 8) | 26305 |
| Hexadecimal (base 16) | 2CC5 |
| Base 3 | 120201111 |
| As time | 11461 seconds = 3 h 11 min 1 s |
Is 11461 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 1) | 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 2) | 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 4) | 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 10) | 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 11461 a prime number?
No. 11461 = 73 × 157, so it is divisible by 73.
What are the factors of 11461?
1, 73, 157, 11461.
What is 11461 in binary?
10110011000101 (hexadecimal 2CC5, octal 26305).
What is the square root of 11461?
About 107.0561.
Is 11461 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11461?
11461 is a semiprime: 73 × 157, the product of two primes.