The number 15147
15147 is a composite number with 20 divisors. Its prime factorisation is × 11 × 17. Divisors (20): 1, 3, 9, 11, 17, 27, 33, 51, 81, 99, 153, 187, 297, 459, 561, 891 … 15147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15147 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15147 is composite. Its prime factorisation is
- 3
The divisors add up to 26136; without 15147 itself that is 10989, so 15147 is deficient (10989 is less than 15147). Euler's totient φ(15147) = 8640 numbers up to 15147 share no factor with it.
- 4
The digits of 15147 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15147 = 3^{4} \times 11 \times 17 \]15147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 26136 |
| Euler totient φ(n) | 8640 |
| Square | 229431609 |
| Cube | 3475200581523 |
| Square root | 123.073149 (= 9√187) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.5147 × |
15147 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and forty-seven |
| Binary (base 2) | 11101100101011 |
| Octal (base 8) | 35453 |
| Hexadecimal (base 16) | 3B2B |
| Base 3 | 202210000 |
| As time | 15147 seconds = 4 h 12 min 27 s |
Is 15147 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 (15147 ÷ 3 = 5049) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 | Yes (15147 ÷ 9 = 1683) | 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 | Yes (15147 ÷ 11 = 1377) | 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 15147 a prime number?
No. 15147 = × 11 × 17, so it is divisible by 3.
What are the factors of 15147?
1, 3, 9, 11, 17, 27, 33, 51, 81, 99, 153, 187, 297, 459, 561, 891, 1377, 1683, 5049, 15147.
What is 15147 in binary?
11101100101011 (hexadecimal 3B2B, octal 35453).
What is the square root of 15147?
About 123.0731, exactly 9√187.
Is 15147 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15147?
It is a composite number with 20 divisors.