The number 2973
2973 is a binary palindrome (101110011101). Its prime factorisation is 3 × 991. Divisors (4): 1, 3, 991, 2973.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2973: a binary palindrome (101110011101); a semiprime: 3 × 991, the product of two primes.
- 2
2973 is composite. Its prime factorisation is
- 3
The divisors add up to 3968; without 2973 itself that is 995, so 2973 is deficient (995 is less than 2973). Euler's totient φ(2973) = 1980 numbers up to 2973 share no factor with it.
- 4
The digits of 2973 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2973 = 3 \times 991 \]
2973 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 3968 |
| Euler totient φ(n) | 1980 |
| Square | 8838729 |
| Cube | 26277541317 |
| Square root | 54.525224 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 97 |
| Scientific notation | 2.973 × |
2973 in other forms
| Form | Value |
|---|---|
| In words | two thousand nine hundred and seventy-three |
| Roman numerals | MMCMLXXIII |
| Binary (base 2) | 101110011101 |
| Octal (base 8) | 5635 |
| Hexadecimal (base 16) | B9D |
| Base 3 | 11002010 |
| As time | 2973 seconds = 49 min 33 s |
Is 2973 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 (2973 ÷ 3 = 991) | 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 5) | 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 3) | 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 3) | 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 2973 a prime number?
No. 2973 = 3 × 991, so it is divisible by 3.
What are the factors of 2973?
1, 3, 991, 2973.
What is 2973 in binary?
101110011101 (hexadecimal B9D, octal 5635).
What is the square root of 2973?
About 54.5252.
What is 2973 in Roman numerals?
MMCMLXXIII.
Is 2973 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 2973?
2973 is a binary palindrome (101110011101); a semiprime: 3 × 991, the product of two primes.