The number 65070
65070 is a composite number with 32 divisors. Its prime factorisation is 2 × × 5 × 241. Divisors (32): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 241 … 65070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65070: a Harshad number: divisible by its digit sum 18.
- 2
65070 is composite. Its prime factorisation is
- 3
The divisors add up to 174240; without 65070 itself that is 109170, so 65070 is abundant (109170 is more than 65070). Euler's totient φ(65070) = 17280 numbers up to 65070 share no factor with it.
- 4
The digits of 65070 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65070 = 2 \times 3^{3} \times 5 \times 241 \]65070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 174240 |
| Euler totient φ(n) | 17280 |
| Square | 4234104900 |
| Cube | 275513205843000 |
| Square root | 255.088220 (= 3√7230) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.507 × |
65070 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand and seventy |
| Binary (base 2) | 1111111000101110 |
| Octal (base 8) | 177056 |
| Hexadecimal (base 16) | FE2E |
| Base 3 | 10022021000 |
| As time | 65070 seconds = 18 h 4 min 30 s |
Is 65070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (65070 ÷ 2 = 32535) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (65070 ÷ 3 = 21690) | 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 (65070 ÷ 5 = 13014) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (65070 ÷ 6 = 10845) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (65070 ÷ 9 = 7230) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (65070 ÷ 10 = 6507) | 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 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65070 a prime number?
No. 65070 = 2 × × 5 × 241, so it is divisible by 2.
What are the factors of 65070?
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 241, 270, 482, 723, 1205, 1446, 2169, 2410, 3615, 4338, 6507, 7230, 10845, 13014, 21690, 32535, 65070.
What is 65070 in binary?
1111111000101110 (hexadecimal FE2E, octal 177056).
What is the square root of 65070?
About 255.0882, exactly 3√7230.
Is 65070 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 65070?
65070 is a Harshad number: divisible by its digit sum 18.