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