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