The number 49503
49503 is a composite number with 8 divisors. Its prime factorisation is 3 × 29 × 569. Divisors (8): 1, 3, 29, 87, 569, 1707, 16501, 49503.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49503 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49503 is composite. Its prime factorisation is
- 3
The divisors add up to 68400; without 49503 itself that is 18897, so 49503 is deficient (18897 is less than 49503). Euler's totient φ(49503) = 31808 numbers up to 49503 share no factor with it.
- 4
The digits of 49503 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 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49503 = 3 \times 29 \times 569 \]
49503 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 68400 |
| Euler totient φ(n) | 31808 |
| Square | 2450547009 |
| Cube | 121309428586527 |
| Square root | 222.492697 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9503 × |
49503 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and three |
| Binary (base 2) | 1100000101011111 |
| Octal (base 8) | 140537 |
| Hexadecimal (base 16) | C15F |
| Base 3 | 2111220110 |
| As time | 49503 seconds = 13 h 45 min 3 s |
Is 49503 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 (49503 ÷ 3 = 16501) | 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 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 7) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49503 a prime number?
No. 49503 = 3 × 29 × 569, so it is divisible by 3.
What are the factors of 49503?
1, 3, 29, 87, 569, 1707, 16501, 49503.
What is 49503 in binary?
1100000101011111 (hexadecimal C15F, octal 140537).
What is the square root of 49503?
About 222.4927.
Is 49503 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49503?
It is a composite number with 8 divisors.