The number 1351
1351 is a composite number with 4 divisors. Its prime factorisation is 7 × 193. Divisors (4): 1, 7, 193, 1351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1351: a semiprime: 7 × 193, the product of two primes.
- 2
1351 is composite. Its prime factorisation is
- 3
The divisors add up to 1552; without 1351 itself that is 201, so 1351 is deficient (201 is less than 1351). Euler's totient φ(1351) = 1152 numbers up to 1351 share no factor with it.
- 4
The digits of 1351 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1351 = 7 \times 193 \]
1351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1552 |
| Euler totient φ(n) | 1152 |
| Square | 1825201 |
| Cube | 2465846551 |
| Square root | 36.755952 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 1.351 × |
1351 in other forms
| Form | Value |
|---|---|
| In words | one thousand three hundred and fifty-one |
| Roman numerals | MCCCLI |
| Binary (base 2) | 10101000111 |
| Octal (base 8) | 2507 |
| Hexadecimal (base 16) | 547 |
| Base 3 | 1212001 |
| As time | 1351 seconds = 22 min 31 s |
Is 1351 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | Yes (1351 ÷ 7 = 193) | 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 7) | 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 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1351 a prime number?
No. 1351 = 7 × 193, so it is divisible by 7.
What are the factors of 1351?
1, 7, 193, 1351.
What is 1351 in binary?
10101000111 (hexadecimal 547, octal 2507).
What is the square root of 1351?
About 36.7560.
What is 1351 in Roman numerals?
MCCCLI.
Is 1351 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 1351?
1351 is a semiprime: 7 × 193, the product of two primes.