The number 49541
49541 is a composite number with 4 divisors. Its prime factorisation is 107 × 463. Divisors (4): 1, 107, 463, 49541.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49541: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 107 × 463, the product of two primes.
- 2
49541 is composite. Its prime factorisation is
- 3
The divisors add up to 50112; without 49541 itself that is 571, so 49541 is deficient (571 is less than 49541). Euler's totient φ(49541) = 48972 numbers up to 49541 share no factor with it.
- 4
The digits of 49541 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49541 = 107 \times 463 \]
49541 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50112 |
| Euler totient φ(n) | 48972 |
| Square | 2454310681 |
| Cube | 121589005447421 |
| Square root | 222.578076 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9541 × |
49541 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and forty-one |
| Binary (base 2) | 1100000110000101 |
| Octal (base 8) | 140605 |
| Hexadecimal (base 16) | C185 |
| Base 3 | 2111221212 |
| As time | 49541 seconds = 13 h 45 min 41 s |
Is 49541 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 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 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 8) | 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 49541 a prime number?
No. 49541 = 107 × 463, so it is divisible by 107.
What are the factors of 49541?
1, 107, 463, 49541.
What is 49541 in binary?
1100000110000101 (hexadecimal C185, octal 140605).
What is the square root of 49541?
About 222.5781.
Is 49541 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49541?
49541 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 107 × 463, the product of two primes.