The number 3151
3151 is a composite number with 4 divisors. Its prime factorisation is 23 × 137. Divisors (4): 1, 23, 137, 3151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3151: a semiprime: 23 × 137, the product of two primes.
- 2
3151 is composite. Its prime factorisation is
- 3
The divisors add up to 3312; without 3151 itself that is 161, so 3151 is deficient (161 is less than 3151). Euler's totient φ(3151) = 2992 numbers up to 3151 share no factor with it.
- 4
The digits of 3151 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 61 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3151 = 23 \times 137 \]
3151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 3312 |
| Euler totient φ(n) | 2992 |
| Square | 9928801 |
| Cube | 31285651951 |
| Square root | 56.133769 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 61 |
| Scientific notation | 3.151 × |
3151 in other forms
| Form | Value |
|---|---|
| In words | three thousand one hundred and fifty-one |
| Roman numerals | MMMCLI |
| Binary (base 2) | 110001001111 |
| Octal (base 8) | 6117 |
| Hexadecimal (base 16) | C4F |
| Base 3 | 11022201 |
| As time | 3151 seconds = 52 min 31 s |
Is 3151 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 | 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 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 5) | 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 3151 a prime number?
No. 3151 = 23 × 137, so it is divisible by 23.
What are the factors of 3151?
1, 23, 137, 3151.
What is 3151 in binary?
110001001111 (hexadecimal C4F, octal 6117).
What is the square root of 3151?
About 56.1338.
What is 3151 in Roman numerals?
MMMCLI.
Is 3151 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 3151?
3151 is a semiprime: 23 × 137, the product of two primes.