The number 15132
15132 is a composite number with 24 divisors. Its prime factorisation is × 3 × 13 × 97. Divisors (24): 1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 97, 156, 194, 291, 388 … 15132.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15132: a Harshad number: divisible by its digit sum 12.
- 2
15132 is composite. Its prime factorisation is
- 3
The divisors add up to 38416; without 15132 itself that is 23284, so 15132 is abundant (23284 is more than 15132). Euler's totient φ(15132) = 4608 numbers up to 15132 share no factor with it.
- 4
The digits of 15132 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15132 = 2^{2} \times 3 \times 13 \times 97 \]15132 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 38416 |
| Euler totient φ(n) | 4608 |
| Square | 228977424 |
| Cube | 3464886379968 |
| Square root | 123.012195 (= 2√3783) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5132 × |
15132 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and thirty-two |
| Binary (base 2) | 11101100011100 |
| Octal (base 8) | 35434 |
| Hexadecimal (base 16) | 3B1C |
| Base 3 | 202202110 |
| As time | 15132 seconds = 4 h 12 min 12 s |
Is 15132 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15132 ÷ 2 = 7566) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15132 ÷ 3 = 5044) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15132 ÷ 4 = 3783) | 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 | Yes (15132 ÷ 6 = 2522) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (15132 ÷ 12 = 1261) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15132 a prime number?
No. 15132 = × 3 × 13 × 97, so it is divisible by 2.
What are the factors of 15132?
1, 2, 3, 4, 6, 12, 13, 26, 39, 52, 78, 97, 156, 194, 291, 388, 582, 1164, 1261, 2522, 3783, 5044, 7566, 15132.
What is 15132 in binary?
11101100011100 (hexadecimal 3B1C, octal 35434).
What is the square root of 15132?
About 123.0122, exactly 2√3783.
Is 15132 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15132?
15132 is a Harshad number: divisible by its digit sum 12.