The number 48635
48635 is a composite number with 8 divisors. Its prime factorisation is 5 × 71 × 137. Divisors (8): 1, 5, 71, 137, 355, 685, 9727, 48635.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48635 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48635 is composite. Its prime factorisation is
- 3
The divisors add up to 59616; without 48635 itself that is 10981, so 48635 is deficient (10981 is less than 48635). Euler's totient φ(48635) = 38080 numbers up to 48635 share no factor with it.
- 4
The digits of 48635 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48635 = 5 \times 71 \times 137 \]
48635 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 59616 |
| Euler totient φ(n) | 38080 |
| Square | 2365363225 |
| Cube | 115039440447875 |
| Square root | 220.533444 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8635 × |
48635 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand six hundred and thirty-five |
| Binary (base 2) | 1011110111111011 |
| Octal (base 8) | 136773 |
| Hexadecimal (base 16) | BDFB |
| Base 3 | 2110201022 |
| As time | 48635 seconds = 13 h 30 min 35 s |
Is 48635 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 | Yes (48635 ÷ 5 = 9727) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 4) | 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 48635 a prime number?
No. 48635 = 5 × 71 × 137, so it is divisible by 5.
What are the factors of 48635?
1, 5, 71, 137, 355, 685, 9727, 48635.
What is 48635 in binary?
1011110111111011 (hexadecimal BDFB, octal 136773).
What is the square root of 48635?
About 220.5334.
Is 48635 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 48635?
It is a composite number with 8 divisors.