The number 1598
1598 is a composite number with 8 divisors. Its prime factorisation is 2 × 17 × 47. Divisors (8): 1, 2, 17, 34, 47, 94, 799, 1598.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1598 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1598 is composite. Its prime factorisation is
- 3
The divisors add up to 2592; without 1598 itself that is 994, so 1598 is deficient (994 is less than 1598). Euler's totient φ(1598) = 736 numbers up to 1598 share no factor with it.
- 4
The digits of 1598 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1598 = 2 \times 17 \times 47 \]
1598 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2592 |
| Euler totient φ(n) | 736 |
| Square | 2553604 |
| Cube | 4080659192 |
| Square root | 39.974992 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 73 |
| Scientific notation | 1.598 × |
1598 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and ninety-eight |
| Roman numerals | MDXCVIII |
| Binary (base 2) | 11000111110 |
| Octal (base 8) | 3076 |
| Hexadecimal (base 16) | 63E |
| Base 3 | 2012012 |
| As time | 1598 seconds = 26 min 38 s |
Is 1598 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1598 ÷ 2 = 799) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1598 a prime number?
No. 1598 = 2 × 17 × 47, so it is divisible by 2.
What are the factors of 1598?
1, 2, 17, 34, 47, 94, 799, 1598.
What is 1598 in binary?
11000111110 (hexadecimal 63E, octal 3076).
What is the square root of 1598?
About 39.9750.
What is 1598 in Roman numerals?
MDXCVIII.
Is 1598 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 1598?
It is a composite number with 8 divisors.