The number 4157
4157 is a twin prime (4157 and 4159 are both prime) and the 572nd prime number. Its only divisors are 1 and 4157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4157: a twin prime (4157 and 4159 are both prime); the 572nd prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
4157 is prime, so its only factors are 1 and 4157. It is the 572nd prime; the next prime is 4159 and the one before is 4153.
- 3
The divisors add up to 4158; without 4157 itself that is 1, so 4157 is deficient (1 is less than 4157). Euler's totient φ(4157) = 4156 numbers up to 4157 share no factor with it.
- 4
The digits of 4157 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 64 steps to reach 1.
4157 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 4158 |
| Euler totient φ(n) | 4156 |
| Square | 17280649 |
| Cube | 71835657893 |
| Square root | 64.474801 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 64 |
| Scientific notation | 4.157 × |
4157 in other forms
| Form | Value |
|---|---|
| In words | four thousand one hundred and fifty-seven |
| Binary (base 2) | 1000000111101 |
| Octal (base 8) | 10075 |
| Hexadecimal (base 16) | 103D |
| Base 3 | 12200222 |
| As time | 4157 seconds = 1 h 9 min 17 s |
Is 4157 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 | No (remainder 6) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 4157 a prime number?
Yes. 4157 is divisible only by 1 and itself.
What are the factors of 4157?
1, 4157.
What is 4157 in binary?
1000000111101 (hexadecimal 103D, octal 10075).
What is the square root of 4157?
About 64.4748.
Is 4157 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 4157?
4157 is a twin prime (4157 and 4159 are both prime); the 572nd prime number; a happy number: repeatedly adding the squares of its digits reaches 1.