The number 6913
6913 is a composite number with 4 divisors. Its prime factorisation is 31 × 223. Divisors (4): 1, 31, 223, 6913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6913: a semiprime: 31 × 223, the product of two primes.
- 2
6913 is composite. Its prime factorisation is
- 3
The divisors add up to 7168; without 6913 itself that is 255, so 6913 is deficient (255 is less than 6913). Euler's totient φ(6913) = 6660 numbers up to 6913 share no factor with it.
- 4
The digits of 6913 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 44 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6913 = 31 \times 223 \]
6913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7168 |
| Euler totient φ(n) | 6660 |
| Square | 47789569 |
| Cube | 330369290497 |
| Square root | 83.144453 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 44 |
| Scientific notation | 6.913 × |
6913 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and thirteen |
| Binary (base 2) | 1101100000001 |
| Octal (base 8) | 15401 |
| Hexadecimal (base 16) | 1B01 |
| Base 3 | 100111001 |
| As time | 6913 seconds = 1 h 55 min 13 s |
Is 6913 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 4) | 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 1) | 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 6913 a prime number?
No. 6913 = 31 × 223, so it is divisible by 31.
What are the factors of 6913?
1, 31, 223, 6913.
What is 6913 in binary?
1101100000001 (hexadecimal 1B01, octal 15401).
What is the square root of 6913?
About 83.1445.
Is 6913 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 6913?
6913 is a semiprime: 31 × 223, the product of two primes.