The number 10213
10213 is a composite number with 4 divisors. Its prime factorisation is 7 × 1459. Divisors (4): 1, 7, 1459, 10213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10213: a Harshad number: divisible by its digit sum 7; a semiprime: 7 × 1459, the product of two primes.
- 2
10213 is composite. Its prime factorisation is
- 3
The divisors add up to 11680; without 10213 itself that is 1467, so 10213 is deficient (1467 is less than 10213). Euler's totient φ(10213) = 8748 numbers up to 10213 share no factor with it.
- 4
The digits of 10213 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 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10213 = 7 \times 1459 \]
10213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11680 |
| Euler totient φ(n) | 8748 |
| Square | 104305369 |
| Cube | 1065270733597 |
| Square root | 101.059388 |
| Digit sum / digital root | 7 / 7 |
| Collatz steps to 1 | 179 |
| Scientific notation | 1.0213 × |
10213 in other forms
| Form | Value |
|---|---|
| In words | ten thousand two hundred and thirteen |
| Binary (base 2) | 10011111100101 |
| Octal (base 8) | 23745 |
| Hexadecimal (base 16) | 27E5 |
| Base 3 | 112000021 |
| As time | 10213 seconds = 2 h 50 min 13 s |
Is 10213 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (10213 ÷ 7 = 1459) | 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 5) | 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 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10213 a prime number?
No. 10213 = 7 × 1459, so it is divisible by 7.
What are the factors of 10213?
1, 7, 1459, 10213.
What is 10213 in binary?
10011111100101 (hexadecimal 27E5, octal 23745).
What is the square root of 10213?
About 101.0594.
Is 10213 divisible by 3?
No. Its digits add up to 7, which is not a multiple of 3.
What is special about the number 10213?
10213 is a Harshad number: divisible by its digit sum 7; a semiprime: 7 × 1459, the product of two primes.