The number 49127
49127 is a composite number with 4 divisors. Its prime factorisation is 13 × 3779. Divisors (4): 1, 13, 3779, 49127.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49127: a semiprime: 13 × 3779, the product of two primes.
- 2
49127 is composite. Its prime factorisation is
- 3
The divisors add up to 52920; without 49127 itself that is 3793, so 49127 is deficient (3793 is less than 49127). Euler's totient φ(49127) = 45336 numbers up to 49127 share no factor with it.
- 4
The digits of 49127 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49127 = 13 \times 3779 \]
49127 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 52920 |
| Euler totient φ(n) | 45336 |
| Square | 2413462129 |
| Cube | 118566154011383 |
| Square root | 221.646114 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9127 × |
49127 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and twenty-seven |
| Binary (base 2) | 1011111111100111 |
| Octal (base 8) | 137747 |
| Hexadecimal (base 16) | BFE7 |
| Base 3 | 2111101112 |
| As time | 49127 seconds = 13 h 38 min 47 s |
Is 49127 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 1) | 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 5) | 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 1) | 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 49127 a prime number?
No. 49127 = 13 × 3779, so it is divisible by 13.
What are the factors of 49127?
1, 13, 3779, 49127.
What is 49127 in binary?
1011111111100111 (hexadecimal BFE7, octal 137747).
What is the square root of 49127?
About 221.6461.
Is 49127 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 49127?
49127 is a semiprime: 13 × 3779, the product of two primes.