The number 83130
83130 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 17 × 163. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 17, 30, 34, 51, 85, 102, 163, 170, 255 … 83130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 83130: a Harshad number: divisible by its digit sum 15.
- 2
83130 is composite. Its prime factorisation is
- 3
The divisors add up to 212544; without 83130 itself that is 129414, so 83130 is abundant (129414 is more than 83130). Euler's totient φ(83130) = 20736 numbers up to 83130 share no factor with it.
- 4
The digits of 83130 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 107 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83130 = 2 \times 3 \times 5 \times 17 \times 163 \]
83130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 212544 |
| Euler totient φ(n) | 20736 |
| Square | 6910596900 |
| Cube | 574477920297000 |
| Square root | 288.322736 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 107 |
| Scientific notation | 8.313 × |
83130 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand one hundred and thirty |
| Binary (base 2) | 10100010010111010 |
| Octal (base 8) | 242272 |
| Hexadecimal (base 16) | 144BA |
| Base 3 | 11020000220 |
| As time | 83130 seconds = 23 h 5 min 30 s |
Is 83130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83130 ÷ 2 = 41565) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (83130 ÷ 3 = 27710) | 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 (83130 ÷ 5 = 16626) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (83130 ÷ 6 = 13855) | 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 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 (83130 ÷ 10 = 8313) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 83130 a prime number?
No. 83130 = 2 × 3 × 5 × 17 × 163, so it is divisible by 2.
What are the factors of 83130?
1, 2, 3, 5, 6, 10, 15, 17, 30, 34, 51, 85, 102, 163, 170, 255, 326, 489, 510, 815, 978, 1630, 2445, 2771, 4890, 5542, 8313, 13855, 16626, 27710, 41565, 83130.
What is 83130 in binary?
10100010010111010 (hexadecimal 144BA, octal 242272).
What is the square root of 83130?
About 288.3227.
Is 83130 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 83130?
83130 is a Harshad number: divisible by its digit sum 15.