The number 1599
1599 is a composite number with 8 divisors. Its prime factorisation is 3 × 13 × 41. Divisors (8): 1, 3, 13, 39, 41, 123, 533, 1599.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1599: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
1599 is composite. Its prime factorisation is
- 3
The divisors add up to 2352; without 1599 itself that is 753, so 1599 is deficient (753 is less than 1599). Euler's totient φ(1599) = 960 numbers up to 1599 share no factor with it.
- 4
The digits of 1599 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1599 = 3 \times 13 \times 41 \]
1599 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 2352 |
| Euler totient φ(n) | 960 |
| Square | 2556801 |
| Cube | 4088324799 |
| Square root | 39.987498 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 73 |
| Scientific notation | 1.599 × |
1599 in other forms
| Form | Value |
|---|---|
| In words | one thousand five hundred and ninety-nine |
| Roman numerals | MDXCIX |
| Binary (base 2) | 11000111111 |
| Octal (base 8) | 3077 |
| Hexadecimal (base 16) | 63F |
| Base 3 | 2012020 |
| As time | 1599 seconds = 26 min 39 s |
Is 1599 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 | Yes (1599 ÷ 3 = 533) | 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 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 | No (remainder 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1599 a prime number?
No. 1599 = 3 × 13 × 41, so it is divisible by 3.
What are the factors of 1599?
1, 3, 13, 39, 41, 123, 533, 1599.
What is 1599 in binary?
11000111111 (hexadecimal 63F, octal 3077).
What is the square root of 1599?
About 39.9875.
What is 1599 in Roman numerals?
MDXCIX.
Is 1599 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 1599?
1599 is a happy number: repeatedly adding the squares of its digits reaches 1.