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