The number 48505
48505 is a composite number with 8 divisors. Its prime factorisation is 5 × 89 × 109. Divisors (8): 1, 5, 89, 109, 445, 545, 9701, 48505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48505: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48505 is composite. Its prime factorisation is
- 3
The divisors add up to 59400; without 48505 itself that is 10895, so 48505 is deficient (10895 is less than 48505). Euler's totient φ(48505) = 38016 numbers up to 48505 share no factor with it.
- 4
The digits of 48505 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48505 = 5 \times 89 \times 109 \]
48505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 59400 |
| Euler totient φ(n) | 38016 |
| Square | 2352735025 |
| Cube | 114119412387625 |
| Square root | 220.238507 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8505 × |
48505 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and five |
| Binary (base 2) | 1011110101111001 |
| Octal (base 8) | 136571 |
| Hexadecimal (base 16) | BD79 |
| Base 3 | 2110112111 |
| As time | 48505 seconds = 13 h 28 min 25 s |
Is 48505 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 1) | 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 (48505 ÷ 5 = 9701) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | No (remainder 4) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48505 a prime number?
No. 48505 = 5 × 89 × 109, so it is divisible by 5.
What are the factors of 48505?
1, 5, 89, 109, 445, 545, 9701, 48505.
What is 48505 in binary?
1011110101111001 (hexadecimal BD79, octal 136571).
What is the square root of 48505?
About 220.2385.
Is 48505 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 48505?
48505 is a happy number: repeatedly adding the squares of its digits reaches 1.