The number 4959
4959 is a composite number with 12 divisors. Its prime factorisation is × 19 × 29. Divisors (12): 1, 3, 9, 19, 29, 57, 87, 171, 261, 551, 1653, 4959.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 4959: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
4959 is composite. Its prime factorisation is
- 3
The divisors add up to 7800; without 4959 itself that is 2841, so 4959 is deficient (2841 is less than 4959). Euler's totient φ(4959) = 3024 numbers up to 4959 share no factor with it.
- 4
The digits of 4959 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 46 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4959 = 3^{2} \times 19 \times 29 \]4959 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 7800 |
| Euler totient φ(n) | 3024 |
| Square | 24591681 |
| Cube | 121950146079 |
| Square root | 70.420168 (= 3√551) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 46 |
| Scientific notation | 4.959 × |
4959 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and fifty-nine |
| Binary (base 2) | 1001101011111 |
| Octal (base 8) | 11537 |
| Hexadecimal (base 16) | 135F |
| Base 3 | 20210200 |
| As time | 4959 seconds = 1 h 22 min 39 s |
Is 4959 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 (4959 ÷ 3 = 1653) | 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 | Yes (4959 ÷ 9 = 551) | 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 9) | 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 4959 a prime number?
No. 4959 = × 19 × 29, so it is divisible by 3.
What are the factors of 4959?
1, 3, 9, 19, 29, 57, 87, 171, 261, 551, 1653, 4959.
What is 4959 in binary?
1001101011111 (hexadecimal 135F, octal 11537).
What is the square root of 4959?
About 70.4202, exactly 3√551.
Is 4959 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 4959?
4959 is a happy number: repeatedly adding the squares of its digits reaches 1.