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