The number 10230
10230 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 11 × 31. Divisors (32): 1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 31, 33, 55, 62, 66, 93 … 10230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10230: a Harshad number: divisible by its digit sum 6.
- 2
10230 is composite. Its prime factorisation is
- 3
The divisors add up to 27648; without 10230 itself that is 17418, so 10230 is abundant (17418 is more than 10230). Euler's totient φ(10230) = 2400 numbers up to 10230 share no factor with it.
- 4
The digits of 10230 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10230 = 2 \times 3 \times 5 \times 11 \times 31 \]
10230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 27648 |
| Euler totient φ(n) | 2400 |
| Square | 104652900 |
| Cube | 1070599167000 |
| Square root | 101.143462 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.023 × |
10230 in other forms
| Form | Value |
|---|---|
| In words | ten thousand two hundred and thirty |
| Binary (base 2) | 10011111110110 |
| Octal (base 8) | 23766 |
| Hexadecimal (base 16) | 27F6 |
| Base 3 | 112000220 |
| As time | 10230 seconds = 2 h 50 min 30 s |
Is 10230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10230 ÷ 2 = 5115) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10230 ÷ 3 = 3410) | 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 (10230 ÷ 5 = 2046) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (10230 ÷ 6 = 1705) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10230 ÷ 10 = 1023) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (10230 ÷ 11 = 930) | 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 10230 a prime number?
No. 10230 = 2 × 3 × 5 × 11 × 31, so it is divisible by 2.
What are the factors of 10230?
1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 31, 33, 55, 62, 66, 93, 110, 155, 165, 186, 310, 330, 341, 465, 682, 930, 1023, 1705, 2046, 3410, 5115, 10230.
What is 10230 in binary?
10011111110110 (hexadecimal 27F6, octal 23766).
What is the square root of 10230?
About 101.1435.
Is 10230 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 10230?
10230 is a Harshad number: divisible by its digit sum 6.