The number 49053
49053 is a composite number with 8 divisors. Its prime factorisation is 3 × 83 × 197. Divisors (8): 1, 3, 83, 197, 249, 591, 16351, 49053.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49053 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49053 is composite. Its prime factorisation is
- 3
The divisors add up to 66528; without 49053 itself that is 17475, so 49053 is deficient (17475 is less than 49053). Euler's totient φ(49053) = 32144 numbers up to 49053 share no factor with it.
- 4
The digits of 49053 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49053 = 3 \times 83 \times 197 \]
49053 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 66528 |
| Euler totient φ(n) | 32144 |
| Square | 2406196809 |
| Cube | 118031172071877 |
| Square root | 221.479119 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.9053 × |
49053 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and fifty-three |
| Binary (base 2) | 1011111110011101 |
| Octal (base 8) | 137635 |
| Hexadecimal (base 16) | BF9D |
| Base 3 | 2111021210 |
| As time | 49053 seconds = 13 h 37 min 33 s |
Is 49053 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 (49053 ÷ 3 = 16351) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 4) | 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 49053 a prime number?
No. 49053 = 3 × 83 × 197, so it is divisible by 3.
What are the factors of 49053?
1, 3, 83, 197, 249, 591, 16351, 49053.
What is 49053 in binary?
1011111110011101 (hexadecimal BF9D, octal 137635).
What is the square root of 49053?
About 221.4791.
Is 49053 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49053?
It is a composite number with 8 divisors.