The number 15171
15171 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 389. Divisors (8): 1, 3, 13, 39, 389, 1167, 5057, 15171.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15171 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15171 is composite. Its prime factorisation is
- 3
The divisors add up to 21840; without 15171 itself that is 6669, so 15171 is deficient (6669 is less than 15171). Euler's totient φ(15171) = 9312 numbers up to 15171 share no factor with it.
- 4
The digits of 15171 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15171 = 3 \times 13 \times 389 \]
15171 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21840 |
| Euler totient φ(n) | 9312 |
| Square | 230159241 |
| Cube | 3491745845211 |
| Square root | 123.170613 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5171 × |
15171 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and seventy-one |
| Binary (base 2) | 11101101000011 |
| Octal (base 8) | 35503 |
| Hexadecimal (base 16) | 3B43 |
| Base 3 | 202210220 |
| As time | 15171 seconds = 4 h 12 min 51 s |
Is 15171 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 (15171 ÷ 3 = 5057) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15171 a prime number?
No. 15171 = 3 × 13 × 389, so it is divisible by 3.
What are the factors of 15171?
1, 3, 13, 39, 389, 1167, 5057, 15171.
What is 15171 in binary?
11101101000011 (hexadecimal 3B43, octal 35503).
What is the square root of 15171?
About 123.1706.
Is 15171 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 15171?
It is a composite number with 8 divisors.