The number 49461
49461 is a composite number with 4 divisors. Its prime factorisation is 3 × 16487. Divisors (4): 1, 3, 16487, 49461.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49461: a semiprime: 3 × 16487, the product of two primes.
- 2
49461 is composite. Its prime factorisation is
- 3
The divisors add up to 65952; without 49461 itself that is 16491, so 49461 is deficient (16491 is less than 49461). Euler's totient φ(49461) = 32972 numbers up to 49461 share no factor with it.
- 4
The digits of 49461 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49461 = 3 \times 16487 \]
49461 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65952 |
| Euler totient φ(n) | 32972 |
| Square | 2446390521 |
| Cube | 121000921559181 |
| Square root | 222.398291 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9461 × |
49461 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and sixty-one |
| Binary (base 2) | 1100000100110101 |
| Octal (base 8) | 140465 |
| Hexadecimal (base 16) | C135 |
| Base 3 | 2111211220 |
| As time | 49461 seconds = 13 h 44 min 21 s |
Is 49461 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 (49461 ÷ 3 = 16487) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49461 a prime number?
No. 49461 = 3 × 16487, so it is divisible by 3.
What are the factors of 49461?
1, 3, 16487, 49461.
What is 49461 in binary?
1100000100110101 (hexadecimal C135, octal 140465).
What is the square root of 49461?
About 222.3983.
Is 49461 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49461?
49461 is a semiprime: 3 × 16487, the product of two primes.