The number 1293
1293 is a composite number with 4 divisors. Its prime factorisation is 3 × 431. Divisors (4): 1, 3, 431, 1293.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1293: a semiprime: 3 × 431, the product of two primes.
- 2
1293 is composite. Its prime factorisation is
- 3
The divisors add up to 1728; without 1293 itself that is 435, so 1293 is deficient (435 is less than 1293). Euler's totient φ(1293) = 860 numbers up to 1293 share no factor with it.
- 4
The digits of 1293 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 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1293 = 3 \times 431 \]
1293 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1728 |
| Euler totient φ(n) | 860 |
| Square | 1671849 |
| Cube | 2161700757 |
| Square root | 35.958309 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 101 |
| Scientific notation | 1.293 × |
1293 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and ninety-three |
| Roman numerals | MCCXCIII |
| Binary (base 2) | 10100001101 |
| Octal (base 8) | 2415 |
| Hexadecimal (base 16) | 50D |
| Base 3 | 1202220 |
| As time | 1293 seconds = 21 min 33 s |
Is 1293 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 (1293 ÷ 3 = 431) | 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 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 6) | 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 1293 a prime number?
No. 1293 = 3 × 431, so it is divisible by 3.
What are the factors of 1293?
1, 3, 431, 1293.
What is 1293 in binary?
10100001101 (hexadecimal 50D, octal 2415).
What is the square root of 1293?
About 35.9583.
What is 1293 in Roman numerals?
MCCXCIII.
Is 1293 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1293?
1293 is a semiprime: 3 × 431, the product of two primes.