The number 1532
1532 is a composite number with 6 divisors. Its prime factorisation is × 383. Divisors (6): 1, 2, 4, 383, 766, 1532.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1532 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1532 is composite. Its prime factorisation is
- 3
The divisors add up to 2688; without 1532 itself that is 1156, so 1532 is deficient (1156 is less than 1532). Euler's totient φ(1532) = 764 numbers up to 1532 share no factor with it.
- 4
The digits of 1532 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1532 = 2^{2} \times 383 \]1532 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 2688 |
| Euler totient φ(n) | 764 |
| Square | 2347024 |
| Cube | 3595640768 |
| Square root | 39.140772 (= 2√383) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.532 × |
1532 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and thirty-two |
| Roman numerals | MDXXXII |
| Binary (base 2) | 10111111100 |
| Octal (base 8) | 2774 |
| Hexadecimal (base 16) | 5FC |
| Base 3 | 2002202 |
| As time | 1532 seconds = 25 min 32 s |
Is 1532 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1532 ÷ 2 = 766) | 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 (1532 ÷ 4 = 383) | 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 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 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 3) | 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 1532 a prime number?
No. 1532 = × 383, so it is divisible by 2.
What are the factors of 1532?
1, 2, 4, 383, 766, 1532.
What is 1532 in binary?
10111111100 (hexadecimal 5FC, octal 2774).
What is the square root of 1532?
About 39.1408, exactly 2√383.
What is 1532 in Roman numerals?
MDXXXII.
Is 1532 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1532?
It is a composite number with 6 divisors.