The number 49029
49029 is a composite number with 8 divisors. Its prime factorisation is 3 × 59 × 277. Divisors (8): 1, 3, 59, 177, 277, 831, 16343, 49029.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49029 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49029 is composite. Its prime factorisation is
- 3
The divisors add up to 66720; without 49029 itself that is 17691, so 49029 is deficient (17691 is less than 49029). Euler's totient φ(49029) = 32016 numbers up to 49029 share no factor with it.
- 4
The digits of 49029 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49029 = 3 \times 59 \times 277 \]
49029 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 66720 |
| Euler totient φ(n) | 32016 |
| Square | 2403842841 |
| Cube | 117858010651389 |
| Square root | 221.424931 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9029 × |
49029 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and twenty-nine |
| Binary (base 2) | 1011111110000101 |
| Octal (base 8) | 137605 |
| Hexadecimal (base 16) | BF85 |
| Base 3 | 2111020220 |
| As time | 49029 seconds = 13 h 37 min 9 s |
Is 49029 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 (49029 ÷ 3 = 16343) | 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 4) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49029 a prime number?
No. 49029 = 3 × 59 × 277, so it is divisible by 3.
What are the factors of 49029?
1, 3, 59, 177, 277, 831, 16343, 49029.
What is 49029 in binary?
1011111110000101 (hexadecimal BF85, octal 137605).
What is the square root of 49029?
About 221.4249.
Is 49029 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 49029?
It is a composite number with 8 divisors.