The number 49502
49502 is a composite number with 8 divisors. Its prime factorisation is 2 × 53 × 467. Divisors (8): 1, 2, 53, 106, 467, 934, 24751, 49502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49502 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49502 is composite. Its prime factorisation is
- 3
The divisors add up to 75816; without 49502 itself that is 26314, so 49502 is deficient (26314 is less than 49502). Euler's totient φ(49502) = 24232 numbers up to 49502 share no factor with it.
- 4
The digits of 49502 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49502 = 2 \times 53 \times 467 \]
49502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 75816 |
| Euler totient φ(n) | 24232 |
| Square | 2450448004 |
| Cube | 121302077094008 |
| Square root | 222.490449 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9502 × |
49502 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and two |
| Binary (base 2) | 1100000101011110 |
| Octal (base 8) | 140536 |
| Hexadecimal (base 16) | C15E |
| Base 3 | 2111220102 |
| As time | 49502 seconds = 13 h 45 min 2 s |
Is 49502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (49502 ÷ 2 = 24751) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49502 a prime number?
No. 49502 = 2 × 53 × 467, so it is divisible by 2.
What are the factors of 49502?
1, 2, 53, 106, 467, 934, 24751, 49502.
What is 49502 in binary?
1100000101011110 (hexadecimal C15E, octal 140536).
What is the square root of 49502?
About 222.4904.
Is 49502 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49502?
It is a composite number with 8 divisors.