The number 49543
49543 is a composite number with 8 divisors. Its prime factorisation is 13 × 37 × 103. Divisors (8): 1, 13, 37, 103, 481, 1339, 3811, 49543.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49543 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49543 is composite. Its prime factorisation is
- 3
The divisors add up to 55328; without 49543 itself that is 5785, so 49543 is deficient (5785 is less than 49543). Euler's totient φ(49543) = 44064 numbers up to 49543 share no factor with it.
- 4
The digits of 49543 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49543 = 13 \times 37 \times 103 \]
49543 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 55328 |
| Euler totient φ(n) | 44064 |
| Square | 2454508849 |
| Cube | 121603731906007 |
| Square root | 222.582569 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9543 × |
49543 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and forty-three |
| Binary (base 2) | 1100000110000111 |
| Octal (base 8) | 140607 |
| Hexadecimal (base 16) | C187 |
| Base 3 | 2111221221 |
| As time | 49543 seconds = 13 h 45 min 43 s |
Is 49543 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 4) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49543 a prime number?
No. 49543 = 13 × 37 × 103, so it is divisible by 13.
What are the factors of 49543?
1, 13, 37, 103, 481, 1339, 3811, 49543.
What is 49543 in binary?
1100000110000111 (hexadecimal C187, octal 140607).
What is the square root of 49543?
About 222.5826.
Is 49543 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49543?
It is a composite number with 8 divisors.