The number 1552
1552 is a composite number with 10 divisors. Its prime factorisation is × 97. Divisors (10): 1, 2, 4, 8, 16, 97, 194, 388, 776, 1552.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1552 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1552 is composite. Its prime factorisation is
- 3
The divisors add up to 3038; without 1552 itself that is 1486, so 1552 is deficient (1486 is less than 1552). Euler's totient φ(1552) = 768 numbers up to 1552 share no factor with it.
- 4
The digits of 1552 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1552 = 2^{4} \times 97 \]1552 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 3038 |
| Euler totient φ(n) | 768 |
| Square | 2408704 |
| Cube | 3738308608 |
| Square root | 39.395431 (= 4√97) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.552 × |
1552 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and fifty-two |
| Roman numerals | MDLII |
| Binary (base 2) | 11000010000 |
| Octal (base 8) | 3020 |
| Hexadecimal (base 16) | 610 |
| Base 3 | 2010111 |
| As time | 1552 seconds = 25 min 52 s |
Is 1552 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1552 ÷ 2 = 776) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (1552 ÷ 4 = 388) | 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 4) | 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 | Yes (1552 ÷ 8 = 194) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1552 a prime number?
No. 1552 = × 97, so it is divisible by 2.
What are the factors of 1552?
1, 2, 4, 8, 16, 97, 194, 388, 776, 1552.
What is 1552 in binary?
11000010000 (hexadecimal 610, octal 3020).
What is the square root of 1552?
About 39.3954, exactly 4√97.
What is 1552 in Roman numerals?
MDLII.
Is 1552 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1552?
It is a composite number with 10 divisors.