The number 1595
1595 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 29. Divisors (8): 1, 5, 11, 29, 55, 145, 319, 1595.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1595 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1595 is composite. Its prime factorisation is
- 3
The divisors add up to 2160; without 1595 itself that is 565, so 1595 is deficient (565 is less than 1595). Euler's totient φ(1595) = 1120 numbers up to 1595 share no factor with it.
- 4
The digits of 1595 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1595 = 5 \times 11 \times 29 \]
1595 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2160 |
| Euler totient φ(n) | 1120 |
| Square | 2544025 |
| Cube | 4057719875 |
| Square root | 39.937451 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 73 |
| Scientific notation | 1.595 × |
1595 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and ninety-five |
| Roman numerals | MDXCV |
| Binary (base 2) | 11000111011 |
| Octal (base 8) | 3073 |
| Hexadecimal (base 16) | 63B |
| Base 3 | 2012002 |
| As time | 1595 seconds = 26 min 35 s |
Is 1595 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 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (1595 ÷ 5 = 319) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (1595 ÷ 11 = 145) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1595 a prime number?
No. 1595 = 5 × 11 × 29, so it is divisible by 5.
What are the factors of 1595?
1, 5, 11, 29, 55, 145, 319, 1595.
What is 1595 in binary?
11000111011 (hexadecimal 63B, octal 3073).
What is the square root of 1595?
About 39.9375.
What is 1595 in Roman numerals?
MDXCV.
Is 1595 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 1595?
It is a composite number with 8 divisors.