The number 49007
49007 is a composite number with 4 divisors. Its prime factorisation is 7 × 7001. Divisors (4): 1, 7, 7001, 49007.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49007: a semiprime: 7 × 7001, the product of two primes.
- 2
49007 is composite. Its prime factorisation is
- 3
The divisors add up to 56016; without 49007 itself that is 7009, so 49007 is deficient (7009 is less than 49007). Euler's totient φ(49007) = 42000 numbers up to 49007 share no factor with it.
- 4
The digits of 49007 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49007 = 7 \times 7001 \]
49007 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56016 |
| Euler totient φ(n) | 42000 |
| Square | 2401686049 |
| Cube | 117699428203343 |
| Square root | 221.375247 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 171 |
| Scientific notation | 4.9007 × |
49007 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and seven |
| Binary (base 2) | 1011111101101111 |
| Octal (base 8) | 137557 |
| Hexadecimal (base 16) | BF6F |
| Base 3 | 2111020002 |
| As time | 49007 seconds = 13 h 36 min 47 s |
Is 49007 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (49007 ÷ 7 = 7001) | 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 2) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49007 a prime number?
No. 49007 = 7 × 7001, so it is divisible by 7.
What are the factors of 49007?
1, 7, 7001, 49007.
What is 49007 in binary?
1011111101101111 (hexadecimal BF6F, octal 137557).
What is the square root of 49007?
About 221.3752.
Is 49007 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49007?
49007 is a semiprime: 7 × 7001, the product of two primes.