The number 15071
15071 is a composite number with 4 divisors. Its prime factorisation is 7 × 2153. Divisors (4): 1, 7, 2153, 15071.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15071: a semiprime: 7 × 2153, the product of two primes.
- 2
15071 is composite. Its prime factorisation is
- 3
The divisors add up to 17232; without 15071 itself that is 2161, so 15071 is deficient (2161 is less than 15071). Euler's totient φ(15071) = 12912 numbers up to 15071 share no factor with it.
- 4
The digits of 15071 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 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15071 = 7 \times 2153 \]
15071 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17232 |
| Euler totient φ(n) | 12912 |
| Square | 227135041 |
| Cube | 3423152202911 |
| Square root | 122.764001 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.5071 × |
15071 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and seventy-one |
| Binary (base 2) | 11101011011111 |
| Octal (base 8) | 35337 |
| Hexadecimal (base 16) | 3ADF |
| Base 3 | 202200012 |
| As time | 15071 seconds = 4 h 11 min 11 s |
Is 15071 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 (15071 ÷ 7 = 2153) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15071 a prime number?
No. 15071 = 7 × 2153, so it is divisible by 7.
What are the factors of 15071?
1, 7, 2153, 15071.
What is 15071 in binary?
11101011011111 (hexadecimal 3ADF, octal 35337).
What is the square root of 15071?
About 122.7640.
Is 15071 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 15071?
15071 is a semiprime: 7 × 2153, the product of two primes.