The number 16213
16213 is a composite number with 4 divisors. Its prime factorisation is 31 × 523. Divisors (4): 1, 31, 523, 16213.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16213: a semiprime: 31 × 523, the product of two primes.
- 2
16213 is composite. Its prime factorisation is
- 3
The divisors add up to 16768; without 16213 itself that is 555, so 16213 is deficient (555 is less than 16213). Euler's totient φ(16213) = 15660 numbers up to 16213 share no factor with it.
- 4
The digits of 16213 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16213 = 31 \times 523 \]
16213 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16768 |
| Euler totient φ(n) | 15660 |
| Square | 262861369 |
| Cube | 4261771375597 |
| Square root | 127.330279 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.6213 × |
16213 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand two hundred and thirteen |
| Binary (base 2) | 11111101010101 |
| Octal (base 8) | 37525 |
| Hexadecimal (base 16) | 3F55 |
| Base 3 | 211020111 |
| As time | 16213 seconds = 4 h 30 min 13 s |
Is 16213 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 | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 10) | 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 16213 a prime number?
No. 16213 = 31 × 523, so it is divisible by 31.
What are the factors of 16213?
1, 31, 523, 16213.
What is 16213 in binary?
11111101010101 (hexadecimal 3F55, octal 37525).
What is the square root of 16213?
About 127.3303.
Is 16213 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 16213?
16213 is a semiprime: 31 × 523, the product of two primes.