The number 64140
64140 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 1069. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 1069, 2138, 3207, 4276 … 64140.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 64140: a Harshad number: divisible by its digit sum 15.
- 2
64140 is composite. Its prime factorisation is
- 3
The divisors add up to 179760; without 64140 itself that is 115620, so 64140 is abundant (115620 is more than 64140). Euler's totient φ(64140) = 17088 numbers up to 64140 share no factor with it.
- 4
The digits of 64140 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 64140 = 2^{2} \times 3 \times 5 \times 1069 \]64140 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 179760 |
| Euler totient φ(n) | 17088 |
| Square | 4113939600 |
| Cube | 263868085944000 |
| Square root | 253.258761 (= 2√16035) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 148 |
| Scientific notation | 6.414 × |
64140 in other forms
| Form | Value |
|---|---|
| In words | sixty-four thousand one hundred and forty |
| Binary (base 2) | 1111101010001100 |
| Octal (base 8) | 175214 |
| Hexadecimal (base 16) | FA8C |
| Base 3 | 10020222120 |
| As time | 64140 seconds = 17 h 49 min 0 s |
Is 64140 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (64140 ÷ 2 = 32070) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (64140 ÷ 3 = 21380) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (64140 ÷ 4 = 16035) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (64140 ÷ 5 = 12828) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (64140 ÷ 6 = 10690) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (64140 ÷ 10 = 6414) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (64140 ÷ 12 = 5345) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 64140 a prime number?
No. 64140 = × 3 × 5 × 1069, so it is divisible by 2.
What are the factors of 64140?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 1069, 2138, 3207, 4276, 5345, 6414, 10690, 12828, 16035, 21380, 32070, 64140.
What is 64140 in binary?
1111101010001100 (hexadecimal FA8C, octal 175214).
What is the square root of 64140?
About 253.2588, exactly 2√16035.
Is 64140 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 64140?
64140 is a Harshad number: divisible by its digit sum 15.