The number 49507
49507 is a composite number with 4 divisors. Its prime factorisation is 31 × 1597. Divisors (4): 1, 31, 1597, 49507.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49507: a semiprime: 31 × 1597, the product of two primes.
- 2
49507 is composite. Its prime factorisation is
- 3
The divisors add up to 51136; without 49507 itself that is 1629, so 49507 is deficient (1629 is less than 49507). Euler's totient φ(49507) = 47880 numbers up to 49507 share no factor with it.
- 4
The digits of 49507 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49507 = 31 \times 1597 \]
49507 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51136 |
| Euler totient φ(n) | 47880 |
| Square | 2450943049 |
| Cube | 121338837526843 |
| Square root | 222.501685 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 4.9507 × |
49507 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand five hundred and seven |
| Binary (base 2) | 1100000101100011 |
| Octal (base 8) | 140543 |
| Hexadecimal (base 16) | C163 |
| Base 3 | 2111220121 |
| As time | 49507 seconds = 13 h 45 min 7 s |
Is 49507 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 2) | 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 3) | 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 3) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 49507 a prime number?
No. 49507 = 31 × 1597, so it is divisible by 31.
What are the factors of 49507?
1, 31, 1597, 49507.
What is 49507 in binary?
1100000101100011 (hexadecimal C163, octal 140543).
What is the square root of 49507?
About 222.5017.
Is 49507 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 49507?
49507 is a semiprime: 31 × 1597, the product of two primes.