The number 48506
48506 is a composite number with 8 divisors. Its prime factorisation is 2 × 79 × 307. Divisors (8): 1, 2, 79, 158, 307, 614, 24253, 48506.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48506 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48506 is composite. Its prime factorisation is
- 3
The divisors add up to 73920; without 48506 itself that is 25414, so 48506 is deficient (25414 is less than 48506). Euler's totient φ(48506) = 23868 numbers up to 48506 share no factor with it.
- 4
The digits of 48506 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48506 = 2 \times 79 \times 307 \]
48506 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 73920 |
| Euler totient φ(n) | 23868 |
| Square | 2352832036 |
| Cube | 114126470738216 |
| Square root | 220.240777 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8506 × |
48506 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and six |
| Binary (base 2) | 1011110101111010 |
| Octal (base 8) | 136572 |
| Hexadecimal (base 16) | BD7A |
| Base 3 | 2110112112 |
| As time | 48506 seconds = 13 h 28 min 26 s |
Is 48506 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48506 ÷ 2 = 24253) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48506 a prime number?
No. 48506 = 2 × 79 × 307, so it is divisible by 2.
What are the factors of 48506?
1, 2, 79, 158, 307, 614, 24253, 48506.
What is 48506 in binary?
1011110101111010 (hexadecimal BD7A, octal 136572).
What is the square root of 48506?
About 220.2408.
Is 48506 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 48506?
It is a composite number with 8 divisors.