The number 48465
48465 is a composite number with 16 divisors. Its prime factorisation is × 5 × 359. Divisors (16): 1, 3, 5, 9, 15, 27, 45, 135, 359, 1077, 1795, 3231, 5385, 9693, 16155, 48465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48465: a Harshad number: divisible by its digit sum 27.
- 2
48465 is composite. Its prime factorisation is
- 3
The divisors add up to 86400; without 48465 itself that is 37935, so 48465 is deficient (37935 is less than 48465). Euler's totient φ(48465) = 25776 numbers up to 48465 share no factor with it.
- 4
The digits of 48465 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 189 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48465 = 3^{3} \times 5 \times 359 \]48465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 86400 |
| Euler totient φ(n) | 25776 |
| Square | 2348856225 |
| Cube | 113837316944625 |
| Square root | 220.147678 (= 3√5385) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.8465 × |
48465 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand four hundred and sixty-five |
| Binary (base 2) | 1011110101010001 |
| Octal (base 8) | 136521 |
| Hexadecimal (base 16) | BD51 |
| Base 3 | 2110111000 |
| As time | 48465 seconds = 13 h 27 min 45 s |
Is 48465 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 (48465 ÷ 3 = 16155) | 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 (48465 ÷ 5 = 9693) | 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 4) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (48465 ÷ 9 = 5385) | 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 10) | 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 48465 a prime number?
No. 48465 = × 5 × 359, so it is divisible by 3.
What are the factors of 48465?
1, 3, 5, 9, 15, 27, 45, 135, 359, 1077, 1795, 3231, 5385, 9693, 16155, 48465.
What is 48465 in binary?
1011110101010001 (hexadecimal BD51, octal 136521).
What is the square root of 48465?
About 220.1477, exactly 3√5385.
Is 48465 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 48465?
48465 is a Harshad number: divisible by its digit sum 27.