The number 1959
1959 is a composite number with 4 divisors. Its prime factorisation is 3 × 653. Divisors (4): 1, 3, 653, 1959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1959: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 653, the product of two primes.
- 2
1959 is composite. Its prime factorisation is
- 3
The divisors add up to 2616; without 1959 itself that is 657, so 1959 is deficient (657 is less than 1959). Euler's totient φ(1959) = 1304 numbers up to 1959 share no factor with it.
- 4
The digits of 1959 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1959 = 3 \times 653 \]
1959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2616 |
| Euler totient φ(n) | 1304 |
| Square | 3837681 |
| Cube | 7518017079 |
| Square root | 44.260592 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.959 × |
1959 in other forms
| Form | Value |
|---|---|
| In words | one thousand nine hundred and fifty-nine |
| Roman numerals | MCMLIX |
| Binary (base 2) | 11110100111 |
| Octal (base 8) | 3647 |
| Hexadecimal (base 16) | 7A7 |
| Base 3 | 2200120 |
| As time | 1959 seconds = 32 min 39 s |
Is 1959 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 (1959 ÷ 3 = 653) | 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 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 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 1) | 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 1959 a prime number?
No. 1959 = 3 × 653, so it is divisible by 3.
What are the factors of 1959?
1, 3, 653, 1959.
What is 1959 in binary?
11110100111 (hexadecimal 7A7, octal 3647).
What is the square root of 1959?
About 44.2606.
What is 1959 in Roman numerals?
MCMLIX.
Is 1959 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 1959?
1959 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 653, the product of two primes.