The number 15372
15372 is a composite number with 36 divisors. Its prime factorisation is × × 7 × 61. Divisors (36): 1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 61, 63 … 15372.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15372: a Harshad number: divisible by its digit sum 18.
- 2
15372 is composite. Its prime factorisation is
- 3
The divisors add up to 45136; without 15372 itself that is 29764, so 15372 is abundant (29764 is more than 15372). Euler's totient φ(15372) = 4320 numbers up to 15372 share no factor with it.
- 4
The digits of 15372 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 146 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15372 = 2^{2} \times 3^{2} \times 7 \times 61 \]15372 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 45136 |
| Euler totient φ(n) | 4320 |
| Square | 236298384 |
| Cube | 3632378758848 |
| Square root | 123.983870 (= 6√427) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 146 |
| Scientific notation | 1.5372 × |
15372 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and seventy-two |
| Binary (base 2) | 11110000001100 |
| Octal (base 8) | 36014 |
| Hexadecimal (base 16) | 3C0C |
| Base 3 | 210002100 |
| As time | 15372 seconds = 4 h 16 min 12 s |
Is 15372 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15372 ÷ 2 = 7686) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15372 ÷ 3 = 5124) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (15372 ÷ 4 = 3843) | 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 (15372 ÷ 6 = 2562) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15372 ÷ 7 = 2196) | 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 | Yes (15372 ÷ 9 = 1708) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (15372 ÷ 12 = 1281) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15372 a prime number?
No. 15372 = × × 7 × 61, so it is divisible by 2.
What are the factors of 15372?
1, 2, 3, 4, 6, 7, 9, 12, 14, 18, 21, 28, 36, 42, 61, 63, 84, 122, 126, 183, 244, 252, 366, 427, 549, 732, 854, 1098, 1281, 1708, 2196, 2562, 3843, 5124, 7686, 15372.
What is 15372 in binary?
11110000001100 (hexadecimal 3C0C, octal 36014).
What is the square root of 15372?
About 123.9839, exactly 6√427.
Is 15372 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 15372?
15372 is a Harshad number: divisible by its digit sum 18.