The number 49067
49067 is a composite number with 4 divisors. Its prime factorisation is 139 × 353. Divisors (4): 1, 139, 353, 49067.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49067: a semiprime: 139 × 353, the product of two primes.
- 2
49067 is composite. Its prime factorisation is
- 3
The divisors add up to 49560; without 49067 itself that is 493, so 49067 is deficient (493 is less than 49067). Euler's totient φ(49067) = 48576 numbers up to 49067 share no factor with it.
- 4
The digits of 49067 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49067 = 139 \times 353 \]
49067 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49560 |
| Euler totient φ(n) | 48576 |
| Square | 2407570489 |
| Cube | 118132261183763 |
| Square root | 221.510722 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9067 × |
49067 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and sixty-seven |
| Binary (base 2) | 1011111110101011 |
| Octal (base 8) | 137653 |
| Hexadecimal (base 16) | BFAB |
| Base 3 | 2111022022 |
| As time | 49067 seconds = 13 h 37 min 47 s |
Is 49067 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 | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49067 a prime number?
No. 49067 = 139 × 353, so it is divisible by 139.
What are the factors of 49067?
1, 139, 353, 49067.
What is 49067 in binary?
1011111110101011 (hexadecimal BFAB, octal 137653).
What is the square root of 49067?
About 221.5107.
Is 49067 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49067?
49067 is a semiprime: 139 × 353, the product of two primes.