The number 1572
1572 is a composite number with 12 divisors. Its prime factorisation is × 3 × 131. Divisors (12): 1, 2, 3, 4, 6, 12, 131, 262, 393, 524, 786, 1572.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1572: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
1572 is composite. Its prime factorisation is
- 3
The divisors add up to 3696; without 1572 itself that is 2124, so 1572 is abundant (2124 is more than 1572). Euler's totient φ(1572) = 520 numbers up to 1572 share no factor with it.
- 4
The digits of 1572 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1572 = 2^{2} \times 3 \times 131 \]1572 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 3696 |
| Euler totient φ(n) | 520 |
| Square | 2471184 |
| Cube | 3884701248 |
| Square root | 39.648455 (= 2√393) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.572 × |
1572 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and seventy-two |
| Roman numerals | MDLXXII |
| Binary (base 2) | 11000100100 |
| Octal (base 8) | 3044 |
| Hexadecimal (base 16) | 624 |
| Base 3 | 2011020 |
| As time | 1572 seconds = 26 min 12 s |
Is 1572 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1572 ÷ 2 = 786) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1572 ÷ 3 = 524) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (1572 ÷ 4 = 393) | 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 (1572 ÷ 6 = 262) | 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 6) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (1572 ÷ 12 = 131) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1572 a prime number?
No. 1572 = × 3 × 131, so it is divisible by 2.
What are the factors of 1572?
1, 2, 3, 4, 6, 12, 131, 262, 393, 524, 786, 1572.
What is 1572 in binary?
11000100100 (hexadecimal 624, octal 3044).
What is the square root of 1572?
About 39.6485, exactly 2√393.
What is 1572 in Roman numerals?
MDLXXII.
Is 1572 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 1572?
1572 is a happy number: repeatedly adding the squares of its digits reaches 1.