The number 10157
10157 is a composite number with 4 divisors. Its prime factorisation is 7 × 1451. Divisors (4): 1, 7, 1451, 10157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10157: a semiprime: 7 × 1451, the product of two primes.
- 2
10157 is composite. Its prime factorisation is
- 3
The divisors add up to 11616; without 10157 itself that is 1459, so 10157 is deficient (1459 is less than 10157). Euler's totient φ(10157) = 8700 numbers up to 10157 share no factor with it.
- 4
The digits of 10157 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 179 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10157 = 7 \times 1451 \]
10157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11616 |
| Euler totient φ(n) | 8700 |
| Square | 103164649 |
| Cube | 1047843339893 |
| Square root | 100.781943 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 179 |
| Scientific notation | 1.0157 × |
10157 in other forms
| Form | Value |
|---|---|
| In words | ten thousand one hundred and fifty-seven |
| Binary (base 2) | 10011110101101 |
| Octal (base 8) | 23655 |
| Hexadecimal (base 16) | 27AD |
| Base 3 | 111221012 |
| As time | 10157 seconds = 2 h 49 min 17 s |
Is 10157 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 | Yes (10157 ÷ 7 = 1451) | 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 5) | 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 4) | 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 10157 a prime number?
No. 10157 = 7 × 1451, so it is divisible by 7.
What are the factors of 10157?
1, 7, 1451, 10157.
What is 10157 in binary?
10011110101101 (hexadecimal 27AD, octal 23655).
What is the square root of 10157?
About 100.7819.
Is 10157 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 10157?
10157 is a semiprime: 7 × 1451, the product of two primes.