The number 16913
16913 is a composite number with 4 divisors. Its prime factorisation is 13 × 1301. Divisors (4): 1, 13, 1301, 16913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16913: a semiprime: 13 × 1301, the product of two primes.
- 2
16913 is composite. Its prime factorisation is
- 3
The divisors add up to 18228; without 16913 itself that is 1315, so 16913 is deficient (1315 is less than 16913). Euler's totient φ(16913) = 15600 numbers up to 16913 share no factor with it.
- 4
The digits of 16913 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16913 = 13 \times 1301 \]
16913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 18228 |
| Euler totient φ(n) | 15600 |
| Square | 286049569 |
| Cube | 4837956360497 |
| Square root | 130.049990 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.6913 × |
16913 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and thirteen |
| Binary (base 2) | 100001000010001 |
| Octal (base 8) | 41021 |
| Hexadecimal (base 16) | 4211 |
| Base 3 | 212012102 |
| As time | 16913 seconds = 4 h 41 min 53 s |
Is 16913 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 2) | 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 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16913 a prime number?
No. 16913 = 13 × 1301, so it is divisible by 13.
What are the factors of 16913?
1, 13, 1301, 16913.
What is 16913 in binary?
100001000010001 (hexadecimal 4211, octal 41021).
What is the square root of 16913?
About 130.0500.
Is 16913 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 16913?
16913 is a semiprime: 13 × 1301, the product of two primes.