The number 48504
48504 is a composite number with 32 divisors. Its prime factorisation is × 3 × 43 × 47. Divisors (32): 1, 2, 3, 4, 6, 8, 12, 24, 43, 47, 86, 94, 129, 141, 172, 188 … 48504.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
48504 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
48504 is composite. Its prime factorisation is
- 3
The divisors add up to 126720; without 48504 itself that is 78216, so 48504 is abundant (78216 is more than 48504). Euler's totient φ(48504) = 15456 numbers up to 48504 share no factor with it.
- 4
The digits of 48504 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 48504 = 2^{3} \times 3 \times 43 \times 47 \]48504 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 126720 |
| Euler totient φ(n) | 15456 |
| Square | 2352638016 |
| Cube | 114112354328064 |
| Square root | 220.236237 (= 2√12126) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.8504 × |
48504 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand five hundred and four |
| Binary (base 2) | 1011110101111000 |
| Octal (base 8) | 136570 |
| Hexadecimal (base 16) | BD78 |
| Base 3 | 2110112110 |
| As time | 48504 seconds = 13 h 28 min 24 s |
Is 48504 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (48504 ÷ 2 = 24252) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (48504 ÷ 3 = 16168) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (48504 ÷ 4 = 12126) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (48504 ÷ 6 = 8084) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (48504 ÷ 8 = 6063) | 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 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (48504 ÷ 12 = 4042) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48504 a prime number?
No. 48504 = × 3 × 43 × 47, so it is divisible by 2.
What are the factors of 48504?
1, 2, 3, 4, 6, 8, 12, 24, 43, 47, 86, 94, 129, 141, 172, 188, 258, 282, 344, 376, 516, 564, 1032, 1128, 2021, 4042, 6063, 8084, 12126, 16168, 24252, 48504.
What is 48504 in binary?
1011110101111000 (hexadecimal BD78, octal 136570).
What is the square root of 48504?
About 220.2362, exactly 2√12126.
Is 48504 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 48504?
It is a composite number with 32 divisors.