The number 15157
15157 is a composite number with 4 divisors. Its prime factorisation is 23 × 659. Divisors (4): 1, 23, 659, 15157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15157: a semiprime: 23 × 659, the product of two primes.
- 2
15157 is composite. Its prime factorisation is
- 3
The divisors add up to 15840; without 15157 itself that is 683, so 15157 is deficient (683 is less than 15157). Euler's totient φ(15157) = 14476 numbers up to 15157 share no factor with it.
- 4
The digits of 15157 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15157 = 23 \times 659 \]
15157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15840 |
| Euler totient φ(n) | 14476 |
| Square | 229734649 |
| Cube | 3482088074893 |
| Square root | 123.113769 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.5157 × |
15157 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and fifty-seven |
| Binary (base 2) | 11101100110101 |
| Octal (base 8) | 35465 |
| Hexadecimal (base 16) | 3B35 |
| Base 3 | 202210101 |
| As time | 15157 seconds = 4 h 12 min 37 s |
Is 15157 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 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 1) | 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 1) | 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 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15157 a prime number?
No. 15157 = 23 × 659, so it is divisible by 23.
What are the factors of 15157?
1, 23, 659, 15157.
What is 15157 in binary?
11101100110101 (hexadecimal 3B35, octal 35465).
What is the square root of 15157?
About 123.1138.
Is 15157 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15157?
15157 is a semiprime: 23 × 659, the product of two primes.