The number 49377
49377 is a composite number with 8 divisors. Its prime factorisation is 3 × 109 × 151. Divisors (8): 1, 3, 109, 151, 327, 453, 16459, 49377.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49377 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49377 is composite. Its prime factorisation is
- 3
The divisors add up to 66880; without 49377 itself that is 17503, so 49377 is deficient (17503 is less than 49377). Euler's totient φ(49377) = 32400 numbers up to 49377 share no factor with it.
- 4
The digits of 49377 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49377 = 3 \times 109 \times 151 \]
49377 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 66880 |
| Euler totient φ(n) | 32400 |
| Square | 2438088129 |
| Cube | 120385477545633 |
| Square root | 222.209361 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.9377 × |
49377 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and seventy-seven |
| Binary (base 2) | 1100000011100001 |
| Octal (base 8) | 140341 |
| Hexadecimal (base 16) | C0E1 |
| Base 3 | 2111201210 |
| As time | 49377 seconds = 13 h 42 min 57 s |
Is 49377 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 | Yes (49377 ÷ 3 = 16459) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49377 a prime number?
No. 49377 = 3 × 109 × 151, so it is divisible by 3.
What are the factors of 49377?
1, 3, 109, 151, 327, 453, 16459, 49377.
What is 49377 in binary?
1100000011100001 (hexadecimal C0E1, octal 140341).
What is the square root of 49377?
About 222.2094.
Is 49377 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49377?
It is a composite number with 8 divisors.