The number 63140

Q: Is 63140 a prime number?

No. 63140 = 2^2 × 5 × 7 × 11 × 41, so it is divisible by 2.

63140 is a composite number with 48 divisors. Its prime factorisation is $2^{2}$ × 5 × 7 × 11 × 41. Divisors (48): 1, 2, 4, 5, 7, 10, 11, 14, 20, 22, 28, 35, 41, 44, 55, 70 … 63140.

Number

Pick any whole number from 1 to 100,000.

63140 = 2^{2} \times 5 \times 7 \times 11 \times 41

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

How to work it out

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

LaTeX source of the formulas on this page

\[ 63140 = 2^{2} \times 5 \times 7 \times 11 \times 41 \]

63140 at a glance

Property	Value
Type	composite
Number of divisors	48
Sum of divisors	169344
Euler totient φ(n)	19200
Square	3986659600
Cube	251717687144000
Square root	251.276740 (= 2√15785)
Digit sum / digital root	14 / 5
Collatz steps to 1	179
Scientific notation	6.314 × $10^{4}$

63140 in other forms

Form	Value
In words	sixty-three thousand one hundred and forty
Binary (base 2)	1111011010100100
Octal (base 8)	173244
Hexadecimal (base 16)	F6A4
Base 3	10012121112
As time	63140 seconds = 17 h 32 min 20 s

Is 63140 divisible by 2 to 12?

Divisor	Answer	Rule
2	Yes (63140 ÷ 2 = 31570)	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	Yes (63140 ÷ 4 = 15785)	A number is divisible by 4 if the last two digits make a multiple of 4.
5	Yes (63140 ÷ 5 = 12628)	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	Yes (63140 ÷ 7 = 9020)	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 4)	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	Yes (63140 ÷ 10 = 6314)	A number is divisible by 10 if the last digit is 0.
11	Yes (63140 ÷ 11 = 5740)	A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12	No (remainder 8)	A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 63140 a prime number?

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

What are the factors of 63140?

1, 2, 4, 5, 7, 10, 11, 14, 20, 22, 28, 35, 41, 44, 55, 70, 77, 82, 110, 140, 154, 164, 205, 220, 287, 308, 385, 410, 451, 574, 770, 820, 902, 1148, 1435, 1540, 1804, 2255, 2870, 3157, 4510, 5740, 6314, 9020, 12628, 15785, 31570, 63140.

What is 63140 in binary?

1111011010100100 (hexadecimal F6A4, octal 173244).

What is the square root of 63140?

About 251.2767, exactly 2√15785.

Is 63140 divisible by 3?

No. Its digits add up to 14, which is not a multiple of 3.

What is special about the number 63140?

63140 is a Harshad number: divisible by its digit sum 14.