The number 15572
15572 is a composite number with 12 divisors. Its prime factorisation is × 17 × 229. Divisors (12): 1, 2, 4, 17, 34, 68, 229, 458, 916, 3893, 7786, 15572.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15572 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15572 is composite. Its prime factorisation is
- 3
The divisors add up to 28980; without 15572 itself that is 13408, so 15572 is deficient (13408 is less than 15572). Euler's totient φ(15572) = 7296 numbers up to 15572 share no factor with it.
- 4
The digits of 15572 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 102 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15572 = 2^{2} \times 17 \times 229 \]15572 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 28980 |
| Euler totient φ(n) | 7296 |
| Square | 242487184 |
| Cube | 3776010429248 |
| Square root | 124.787820 (= 2√3893) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 102 |
| Scientific notation | 1.5572 × |
15572 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand five hundred and seventy-two |
| Binary (base 2) | 11110011010100 |
| Octal (base 8) | 36324 |
| Hexadecimal (base 16) | 3CD4 |
| Base 3 | 210100202 |
| As time | 15572 seconds = 4 h 19 min 32 s |
Is 15572 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15572 ÷ 2 = 7786) | 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 | Yes (15572 ÷ 4 = 3893) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15572 a prime number?
No. 15572 = × 17 × 229, so it is divisible by 2.
What are the factors of 15572?
1, 2, 4, 17, 34, 68, 229, 458, 916, 3893, 7786, 15572.
What is 15572 in binary?
11110011010100 (hexadecimal 3CD4, octal 36324).
What is the square root of 15572?
About 124.7878, exactly 2√3893.
Is 15572 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15572?
It is a composite number with 12 divisors.