The number 10913
10913 is a composite number with 4 divisors. Its prime factorisation is 7 × 1559. Divisors (4): 1, 7, 1559, 10913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10913: a semiprime: 7 × 1559, the product of two primes.
- 2
10913 is composite. Its prime factorisation is
- 3
The divisors add up to 12480; without 10913 itself that is 1567, so 10913 is deficient (1567 is less than 10913). Euler's totient φ(10913) = 9348 numbers up to 10913 share no factor with it.
- 4
The digits of 10913 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10913 = 7 \times 1559 \]
10913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12480 |
| Euler totient φ(n) | 9348 |
| Square | 119093569 |
| Cube | 1299668118497 |
| Square root | 104.465305 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.0913 × |
10913 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and thirteen |
| Binary (base 2) | 10101010100001 |
| Octal (base 8) | 25241 |
| Hexadecimal (base 16) | 2AA1 |
| Base 3 | 112222012 |
| As time | 10913 seconds = 3 h 1 min 53 s |
Is 10913 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 | Yes (10913 ÷ 7 = 1559) | 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 5) | 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 1) | 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 10913 a prime number?
No. 10913 = 7 × 1559, so it is divisible by 7.
What are the factors of 10913?
1, 7, 1559, 10913.
What is 10913 in binary?
10101010100001 (hexadecimal 2AA1, octal 25241).
What is the square root of 10913?
About 104.4653.
Is 10913 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 10913?
10913 is a semiprime: 7 × 1559, the product of two primes.