The number 1592
1592 is a composite number with 8 divisors. Its prime factorisation is × 199. Divisors (8): 1, 2, 4, 8, 199, 398, 796, 1592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1592 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1592 is composite. Its prime factorisation is
- 3
The divisors add up to 3000; without 1592 itself that is 1408, so 1592 is deficient (1408 is less than 1592). Euler's totient φ(1592) = 792 numbers up to 1592 share no factor with it.
- 4
The digits of 1592 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
\[ 1592 = 2^{3} \times 199 \]1592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 3000 |
| Euler totient φ(n) | 792 |
| Square | 2534464 |
| Cube | 4034866688 |
| Square root | 39.899875 (= 2√398) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.592 × |
1592 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and ninety-two |
| Roman numerals | MDXCII |
| Binary (base 2) | 11000111000 |
| Octal (base 8) | 3070 |
| Hexadecimal (base 16) | 638 |
| Base 3 | 2011222 |
| As time | 1592 seconds = 26 min 32 s |
Is 1592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1592 ÷ 2 = 796) | 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 (1592 ÷ 4 = 398) | 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 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 | Yes (1592 ÷ 8 = 199) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 1592 a prime number?
No. 1592 = × 199, so it is divisible by 2.
What are the factors of 1592?
1, 2, 4, 8, 199, 398, 796, 1592.
What is 1592 in binary?
11000111000 (hexadecimal 638, octal 3070).
What is the square root of 1592?
About 39.8999, exactly 2√398.
What is 1592 in Roman numerals?
MDXCII.
Is 1592 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1592?
It is a composite number with 8 divisors.