The number 4151
4151 is a composite number with 4 divisors. Its prime factorisation is 7 × 593. Divisors (4): 1, 7, 593, 4151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4151: a semiprime: 7 × 593, the product of two primes.
- 2
4151 is composite. Its prime factorisation is
- 3
The divisors add up to 4752; without 4151 itself that is 601, so 4151 is deficient (601 is less than 4151). Euler's totient φ(4151) = 3552 numbers up to 4151 share no factor with it.
- 4
The digits of 4151 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 95 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4151 = 7 \times 593 \]
4151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 4752 |
| Euler totient φ(n) | 3552 |
| Square | 17230801 |
| Cube | 71525054951 |
| Square root | 64.428255 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 95 |
| Scientific notation | 4.151 × |
4151 in other forms
| Form | Value |
|---|---|
| In words | four thousand one hundred and fifty-one |
| Binary (base 2) | 1000000110111 |
| Octal (base 8) | 10067 |
| Hexadecimal (base 16) | 1037 |
| Base 3 | 12200202 |
| As time | 4151 seconds = 1 h 9 min 11 s |
Is 4151 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (4151 ÷ 7 = 593) | 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 2) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4151 a prime number?
No. 4151 = 7 × 593, so it is divisible by 7.
What are the factors of 4151?
1, 7, 593, 4151.
What is 4151 in binary?
1000000110111 (hexadecimal 1037, octal 10067).
What is the square root of 4151?
About 64.4283.
Is 4151 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 4151?
4151 is a semiprime: 7 × 593, the product of two primes.