The number 48765
48765 is a binary palindrome (1011111001111101). Its prime factorisation is 3 × 5 × 3251. Divisors (8): 1, 3, 5, 15, 3251, 9753, 16255, 48765.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48765: a binary palindrome (1011111001111101); a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48765 is composite. Its prime factorisation is
- 3
The divisors add up to 78048; without 48765 itself that is 29283, so 48765 is deficient (29283 is less than 48765). Euler's totient φ(48765) = 26000 numbers up to 48765 share no factor with it.
- 4
The digits of 48765 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 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48765 = 3 \times 5 \times 3251 \]
48765 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 78048 |
| Euler totient φ(n) | 26000 |
| Square | 2378025225 |
| Cube | 115964400097125 |
| Square root | 220.827987 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8765 × |
48765 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand seven hundred and sixty-five |
| Binary (base 2) | 1011111001111101 |
| Octal (base 8) | 137175 |
| Hexadecimal (base 16) | BE7D |
| Base 3 | 2110220010 |
| As time | 48765 seconds = 13 h 32 min 45 s |
Is 48765 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 (48765 ÷ 3 = 16255) | 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 | Yes (48765 ÷ 5 = 9753) | 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 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 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 5) | 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 48765 a prime number?
No. 48765 = 3 × 5 × 3251, so it is divisible by 3.
What are the factors of 48765?
1, 3, 5, 15, 3251, 9753, 16255, 48765.
What is 48765 in binary?
1011111001111101 (hexadecimal BE7D, octal 137175).
What is the square root of 48765?
About 220.8280.
Is 48765 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 48765?
48765 is a binary palindrome (1011111001111101); a happy number: repeatedly adding the squares of its digits reaches 1.