The number 65130
65130 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 13 × 167. Divisors (32): 1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 65, 78, 130, 167, 195 … 65130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 65130: a Harshad number: divisible by its digit sum 15.
- 2
65130 is composite. Its prime factorisation is
- 3
The divisors add up to 169344; without 65130 itself that is 104214, so 65130 is abundant (104214 is more than 65130). Euler's totient φ(65130) = 15936 numbers up to 65130 share no factor with it.
- 4
The digits of 65130 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 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65130 = 2 \times 3 \times 5 \times 13 \times 167 \]
65130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 169344 |
| Euler totient φ(n) | 15936 |
| Square | 4241916900 |
| Cube | 276276047697000 |
| Square root | 255.205799 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 161 |
| Scientific notation | 6.513 × |
65130 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand one hundred and thirty |
| Binary (base 2) | 1111111001101010 |
| Octal (base 8) | 177152 |
| Hexadecimal (base 16) | FE6A |
| Base 3 | 10022100020 |
| As time | 65130 seconds = 18 h 5 min 30 s |
Is 65130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (65130 ÷ 2 = 32565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (65130 ÷ 3 = 21710) | 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 (65130 ÷ 5 = 13026) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (65130 ÷ 6 = 10855) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | 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 (65130 ÷ 10 = 6513) | 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 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65130 a prime number?
No. 65130 = 2 × 3 × 5 × 13 × 167, so it is divisible by 2.
What are the factors of 65130?
1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 65, 78, 130, 167, 195, 334, 390, 501, 835, 1002, 1670, 2171, 2505, 4342, 5010, 6513, 10855, 13026, 21710, 32565, 65130.
What is 65130 in binary?
1111111001101010 (hexadecimal FE6A, octal 177152).
What is the square root of 65130?
About 255.2058.
Is 65130 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 65130?
65130 is a Harshad number: divisible by its digit sum 15.