The number 49619
49619 is a composite number with 6 divisors. Its prime factorisation is Ć 59. Divisors (6): 1, 29, 59, 841, 1711, 49619.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49619: a Harshad number: divisible by its digit sum 29.
- 2
49619 is composite. Its prime factorisation is
- 3
The divisors add up to 52260; without 49619 itself that is 2641, so 49619 is deficient (2641 is less than 49619). Euler's totient Ļ(49619) = 47096 numbers up to 49619 share no factor with it.
- 4
The digits of 49619 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49619 = 29^{2} \times 59 \]49619 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 52260 |
| Euler totient Ļ(n) | 47096 |
| Square | 2462045161 |
| Cube | 122164218843659 |
| Square root | 222.753227 (= 29ā59) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 140 |
| Scientific notation | 4.9619 Ć |
49619 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and nineteen |
| Binary (base 2) | 1100000111010011 |
| Octal (base 8) | 140723 |
| Hexadecimal (base 16) | C1D3 |
| Base 3 | 2112001202 |
| As time | 49619 seconds = 13 h 46 min 59 s |
Is 49619 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 4) | 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 3) | 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 2) | 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 9) | 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 49619 a prime number?
No. 49619 = Ć 59, so it is divisible by 29.
What are the factors of 49619?
1, 29, 59, 841, 1711, 49619.
What is 49619 in binary?
1100000111010011 (hexadecimal C1D3, octal 140723).
What is the square root of 49619?
About 222.7532, exactly 29ā59.
Is 49619 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 49619?
49619 is a Harshad number: divisible by its digit sum 29.