The number 48510

Q: Is 48510 a prime number?

No. 48510 = 2 × 3^2 × 5 × 7^2 × 11, so it is divisible by 2.

48510 is a composite number with 72 divisors. Its prime factorisation is 2 × $3^{2}$ × 5 × $7^{2}$ × 11. Divisors (72): 1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 18, 21, 22, 30, 33 … 48510.

Number

Pick any whole number from 1 to 100,000.

48510 = 2 \times 3^{2} \times 5 \times 7^{2} \times 11

Explain it step by step in chat Make a short video of it

How to work it out

1
What is special about 48510: a Harshad number: divisible by its digit sum 18.
2
48510 is composite. Its prime factorisation is
$48510 = 2 \times 3^{2} \times 5 \times 7^{2} \times 11$
3
The divisors add up to 160056; without 48510 itself that is 111546, so 48510 is abundant (111546 is more than 48510). Euler's totient φ(48510) = 10080 numbers up to 48510 share no factor with it.
4
The digits of 48510 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.

LaTeX source of the formulas on this page

\[ 48510 = 2 \times 3^{2} \times 5 \times 7^{2} \times 11 \]

48510 at a glance

Property	Value
Type	composite
Number of divisors	72
Sum of divisors	160056
Euler totient φ(n)	10080
Square	2353220100
Cube	114154707051000
Square root	220.249858 (= 21√110)
Digit sum / digital root	18 / 9
Collatz steps to 1	83
Scientific notation	4.851 × $10^{4}$

48510 in other forms

Form	Value
In words	forty-eight thousand five hundred and ten
Binary (base 2)	1011110101111110
Octal (base 8)	136576
Hexadecimal (base 16)	BD7E
Base 3	2110112200
As time	48510 seconds = 13 h 28 min 30 s

Is 48510 divisible by 2 to 12?

Divisor	Answer	Rule
2	Yes (48510 ÷ 2 = 24255)	A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3	Yes (48510 ÷ 3 = 16170)	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	Yes (48510 ÷ 5 = 9702)	A number is divisible by 5 if the last digit is 0 or 5.
6	Yes (48510 ÷ 6 = 8085)	A number is divisible by 6 if it is divisible by both 2 and 3.
7	Yes (48510 ÷ 7 = 6930)	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 6)	A number is divisible by 8 if the last three digits make a multiple of 8.
9	Yes (48510 ÷ 9 = 5390)	A number is divisible by 9 if the digits add up to a multiple of 9.
10	Yes (48510 ÷ 10 = 4851)	A number is divisible by 10 if the last digit is 0.
11	Yes (48510 ÷ 11 = 4410)	A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12	No (remainder 6)	A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 48510 a prime number?

No. 48510 = 2 × $3^{2}$ × 5 × $7^{2}$ × 11, so it is divisible by 2.

What are the factors of 48510?

1, 2, 3, 5, 6, 7, 9, 10, 11, 14, 15, 18, 21, 22, 30, 33, 35, 42, 45, 49, 55, 63, 66, 70, 77, 90, 98, 99, 105, 110, 126, 147, 154, 165, 198, 210, 231, 245, 294, 315, 330, 385, 441, 462, 490, 495, 539, 630, 693, 735, 770, 882, 990, 1078, 1155, 1386, 1470, 1617, 2205, 2310, 2695, 3234, 3465, 4410, 4851, 5390, 6930, 8085, 9702, 16170, 24255, 48510.

What is 48510 in binary?

1011110101111110 (hexadecimal BD7E, octal 136576).

What is the square root of 48510?

About 220.2499, exactly 21√110.

Is 48510 divisible by 3?

Yes. Its digits add up to 18, a multiple of 3.

What is special about the number 48510?

48510 is a Harshad number: divisible by its digit sum 18.