The number 2913
2913 is a composite number with 4 divisors. Its prime factorisation is 3 × 971. Divisors (4): 1, 3, 971, 2913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2913: a semiprime: 3 × 971, the product of two primes.
- 2
2913 is composite. Its prime factorisation is
- 3
The divisors add up to 3888; without 2913 itself that is 975, so 2913 is deficient (975 is less than 2913). Euler's totient φ(2913) = 1940 numbers up to 2913 share no factor with it.
- 4
The digits of 2913 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 110 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2913 = 3 \times 971 \]
2913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 3888 |
| Euler totient φ(n) | 1940 |
| Square | 8485569 |
| Cube | 24718462497 |
| Square root | 53.972215 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 110 |
| Scientific notation | 2.913 × |
2913 in other forms
| Form | Value |
|---|---|
| In words | two thousand nine hundred and thirteen |
| Roman numerals | MMCMXIII |
| Binary (base 2) | 101101100001 |
| Octal (base 8) | 5541 |
| Hexadecimal (base 16) | B61 |
| Base 3 | 10222220 |
| As time | 2913 seconds = 48 min 33 s |
Is 2913 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 | Yes (2913 ÷ 3 = 971) | 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 3) | 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 6) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 2913 a prime number?
No. 2913 = 3 × 971, so it is divisible by 3.
What are the factors of 2913?
1, 3, 971, 2913.
What is 2913 in binary?
101101100001 (hexadecimal B61, octal 5541).
What is the square root of 2913?
About 53.9722.
What is 2913 in Roman numerals?
MMCMXIII.
Is 2913 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 2913?
2913 is a semiprime: 3 × 971, the product of two primes.