The number 12461
12461 is a composite number with 4 divisors. Its prime factorisation is 17 × 733. Divisors (4): 1, 17, 733, 12461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12461: a semiprime: 17 × 733, the product of two primes.
- 2
12461 is composite. Its prime factorisation is
- 3
The divisors add up to 13212; without 12461 itself that is 751, so 12461 is deficient (751 is less than 12461). Euler's totient φ(12461) = 11712 numbers up to 12461 share no factor with it.
- 4
The digits of 12461 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12461 = 17 \times 733 \]
12461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13212 |
| Euler totient φ(n) | 11712 |
| Square | 155276521 |
| Cube | 1934900728181 |
| Square root | 111.628849 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.2461 × |
12461 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand four hundred and sixty-one |
| Binary (base 2) | 11000010101101 |
| Octal (base 8) | 30255 |
| Hexadecimal (base 16) | 30AD |
| Base 3 | 122002112 |
| As time | 12461 seconds = 3 h 27 min 41 s |
Is 12461 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 | 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 5) | 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 9) | 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 12461 a prime number?
No. 12461 = 17 × 733, so it is divisible by 17.
What are the factors of 12461?
1, 17, 733, 12461.
What is 12461 in binary?
11000010101101 (hexadecimal 30AD, octal 30255).
What is the square root of 12461?
About 111.6288.
Is 12461 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 12461?
12461 is a semiprime: 17 × 733, the product of two primes.