The number 49453
49453 is a composite number with 4 divisors. Its prime factorisation is 17 × 2909. Divisors (4): 1, 17, 2909, 49453.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49453: a semiprime: 17 × 2909, the product of two primes.
- 2
49453 is composite. Its prime factorisation is
- 3
The divisors add up to 52380; without 49453 itself that is 2927, so 49453 is deficient (2927 is less than 49453). Euler's totient φ(49453) = 46528 numbers up to 49453 share no factor with it.
- 4
The digits of 49453 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49453 = 17 \times 2909 \]
49453 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52380 |
| Euler totient φ(n) | 46528 |
| Square | 2445599209 |
| Cube | 120942217682677 |
| Square root | 222.380305 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 39 |
| Scientific notation | 4.9453 × |
49453 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and fifty-three |
| Binary (base 2) | 1100000100101101 |
| Octal (base 8) | 140455 |
| Hexadecimal (base 16) | C12D |
| Base 3 | 2111211121 |
| As time | 49453 seconds = 13 h 44 min 13 s |
Is 49453 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 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 5) | 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 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 8) | 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 49453 a prime number?
No. 49453 = 17 × 2909, so it is divisible by 17.
What are the factors of 49453?
1, 17, 2909, 49453.
What is 49453 in binary?
1100000100101101 (hexadecimal C12D, octal 140455).
What is the square root of 49453?
About 222.3803.
Is 49453 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49453?
49453 is a semiprime: 17 × 2909, the product of two primes.