The number 49629
49629 is a composite number with 8 divisors. Its prime factorisation is 3 × 71 × 233. Divisors (8): 1, 3, 71, 213, 233, 699, 16543, 49629.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49629 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49629 is composite. Its prime factorisation is
- 3
The divisors add up to 67392; without 49629 itself that is 17763, so 49629 is deficient (17763 is less than 49629). Euler's totient φ(49629) = 32480 numbers up to 49629 share no factor with it.
- 4
The digits of 49629 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 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49629 = 3 \times 71 \times 233 \]
49629 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 67392 |
| Euler totient φ(n) | 32480 |
| Square | 2463037641 |
| Cube | 122238095085189 |
| Square root | 222.775672 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9629 × |
49629 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and twenty-nine |
| Binary (base 2) | 1100000111011101 |
| Octal (base 8) | 140735 |
| Hexadecimal (base 16) | C1DD |
| Base 3 | 2112002010 |
| As time | 49629 seconds = 13 h 47 min 9 s |
Is 49629 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 (49629 ÷ 3 = 16543) | 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 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 5) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 49629 a prime number?
No. 49629 = 3 × 71 × 233, so it is divisible by 3.
What are the factors of 49629?
1, 3, 71, 213, 233, 699, 16543, 49629.
What is 49629 in binary?
1100000111011101 (hexadecimal C1DD, octal 140735).
What is the square root of 49629?
About 222.7757.
Is 49629 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49629?
It is a composite number with 8 divisors.