The number 49635
49635 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1103. Divisors (12): 1, 3, 5, 9, 15, 45, 1103, 3309, 5515, 9927, 16545, 49635.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49635: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49635 is composite. Its prime factorisation is
- 3
The divisors add up to 86112; without 49635 itself that is 36477, so 49635 is deficient (36477 is less than 49635). Euler's totient φ(49635) = 26448 numbers up to 49635 share no factor with it.
- 4
The digits of 49635 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49635 = 3^{2} \times 5 \times 1103 \]49635 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 86112 |
| Euler totient φ(n) | 26448 |
| Square | 2463633225 |
| Cube | 122282435122875 |
| Square root | 222.789138 (= 3√5515) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9635 × |
49635 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand six hundred and thirty-five |
| Binary (base 2) | 1100000111100011 |
| Octal (base 8) | 140743 |
| Hexadecimal (base 16) | C1E3 |
| Base 3 | 2112002100 |
| As time | 49635 seconds = 13 h 47 min 15 s |
Is 49635 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 (49635 ÷ 3 = 16545) | 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 | Yes (49635 ÷ 5 = 9927) | 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 5) | 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 | Yes (49635 ÷ 9 = 5515) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49635 a prime number?
No. 49635 = × 5 × 1103, so it is divisible by 3.
What are the factors of 49635?
1, 3, 5, 9, 15, 45, 1103, 3309, 5515, 9927, 16545, 49635.
What is 49635 in binary?
1100000111100011 (hexadecimal C1E3, octal 140743).
What is the square root of 49635?
About 222.7891, exactly 3√5515.
Is 49635 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 49635?
49635 is a happy number: repeatedly adding the squares of its digits reaches 1.