The number 8157
8157 is a composite number with 4 divisors. Its prime factorisation is 3 × 2719. Divisors (4): 1, 3, 2719, 8157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8157: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 2719, the product of two primes.
- 2
8157 is composite. Its prime factorisation is
- 3
The divisors add up to 10880; without 8157 itself that is 2723, so 8157 is deficient (2723 is less than 8157). Euler's totient φ(8157) = 5436 numbers up to 8157 share no factor with it.
- 4
The digits of 8157 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8157 = 3 \times 2719 \]
8157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 10880 |
| Euler totient φ(n) | 5436 |
| Square | 66536649 |
| Cube | 542739445893 |
| Square root | 90.316112 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 8.157 × |
8157 in other forms
| Form | Value |
|---|---|
| In words | eight thousand one hundred and fifty-seven |
| Binary (base 2) | 1111111011101 |
| Octal (base 8) | 17735 |
| Hexadecimal (base 16) | 1FDD |
| Base 3 | 102012010 |
| As time | 8157 seconds = 2 h 15 min 57 s |
Is 8157 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 | Yes (8157 ÷ 3 = 2719) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8157 a prime number?
No. 8157 = 3 × 2719, so it is divisible by 3.
What are the factors of 8157?
1, 3, 2719, 8157.
What is 8157 in binary?
1111111011101 (hexadecimal 1FDD, octal 17735).
What is the square root of 8157?
About 90.3161.
Is 8157 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 8157?
8157 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 2719, the product of two primes.