The number 1557
1557 is a composite number with 6 divisors. Its prime factorisation is × 173. Divisors (6): 1, 3, 9, 173, 519, 1557.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1557: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
1557 is composite. Its prime factorisation is
- 3
The divisors add up to 2262; without 1557 itself that is 705, so 1557 is deficient (705 is less than 1557). Euler's totient φ(1557) = 1032 numbers up to 1557 share no factor with it.
- 4
The digits of 1557 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1557 = 3^{2} \times 173 \]1557 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 2262 |
| Euler totient φ(n) | 1032 |
| Square | 2424249 |
| Cube | 3774555693 |
| Square root | 39.458839 (= 3√173) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.557 × |
1557 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and fifty-seven |
| Roman numerals | MDLVII |
| Binary (base 2) | 11000010101 |
| Octal (base 8) | 3025 |
| Hexadecimal (base 16) | 615 |
| Base 3 | 2010200 |
| As time | 1557 seconds = 25 min 57 s |
Is 1557 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1557 ÷ 3 = 519) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (1557 ÷ 9 = 173) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1557 a prime number?
No. 1557 = × 173, so it is divisible by 3.
What are the factors of 1557?
1, 3, 9, 173, 519, 1557.
What is 1557 in binary?
11000010101 (hexadecimal 615, octal 3025).
What is the square root of 1557?
About 39.4588, exactly 3√173.
What is 1557 in Roman numerals?
MDLVII.
Is 1557 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 1557?
1557 is a happy number: repeatedly adding the squares of its digits reaches 1.