The number 1597
1597 is a Fibonacci number and the 251st prime number. Its only divisors are 1 and 1597.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1597: a Fibonacci number; the 251st prime number.
- 2
1597 is prime, so its only factors are 1 and 1597. It is the 251st prime; the next prime is 1601 and the one before is 1583.
- 3
The divisors add up to 1598; without 1597 itself that is 1, so 1597 is deficient (1 is less than 1597). Euler's totient φ(1597) = 1596 numbers up to 1597 share no factor with it.
- 4
The digits of 1597 add up to 22, 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.
1597 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 1598 |
| Euler totient φ(n) | 1596 |
| Square | 2550409 |
| Cube | 4073003173 |
| Square root | 39.962482 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 122 |
| Scientific notation | 1.597 × |
1597 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and ninety-seven |
| Roman numerals | MDXCVII |
| Binary (base 2) | 11000111101 |
| Octal (base 8) | 3075 |
| Hexadecimal (base 16) | 63D |
| Base 3 | 2012011 |
| As time | 1597 seconds = 26 min 37 s |
Is 1597 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | No (remainder 4) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1597 a prime number?
Yes. 1597 is divisible only by 1 and itself.
What are the factors of 1597?
1, 1597.
What is 1597 in binary?
11000111101 (hexadecimal 63D, octal 3075).
What is the square root of 1597?
About 39.9625.
What is 1597 in Roman numerals?
MDXCVII.
Is 1597 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 1597?
1597 is a Fibonacci number; the 251st prime number.