The number 16130
16130 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1613. Divisors (8): 1, 2, 5, 10, 1613, 3226, 8065, 16130.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16130 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16130 is composite. Its prime factorisation is
- 3
The divisors add up to 29052; without 16130 itself that is 12922, so 16130 is deficient (12922 is less than 16130). Euler's totient φ(16130) = 6448 numbers up to 16130 share no factor with it.
- 4
The digits of 16130 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16130 = 2 \times 5 \times 1613 \]
16130 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29052 |
| Euler totient φ(n) | 6448 |
| Square | 260176900 |
| Cube | 4196653397000 |
| Square root | 127.003937 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.613 × |
16130 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and thirty |
| Binary (base 2) | 11111100000010 |
| Octal (base 8) | 37402 |
| Hexadecimal (base 16) | 3F02 |
| Base 3 | 211010102 |
| As time | 16130 seconds = 4 h 28 min 50 s |
Is 16130 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16130 ÷ 2 = 8065) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (16130 ÷ 5 = 3226) | 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 | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (16130 ÷ 10 = 1613) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16130 a prime number?
No. 16130 = 2 × 5 × 1613, so it is divisible by 2.
What are the factors of 16130?
1, 2, 5, 10, 1613, 3226, 8065, 16130.
What is 16130 in binary?
11111100000010 (hexadecimal 3F02, octal 37402).
What is the square root of 16130?
About 127.0039.
Is 16130 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 16130?
It is a composite number with 8 divisors.