The number 4059
4059 is a composite number with 12 divisors. Its prime factorisation is × 11 × 41. Divisors (12): 1, 3, 9, 11, 33, 41, 99, 123, 369, 451, 1353, 4059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4059 is composite. Its prime factorisation is
- 3
The divisors add up to 6552; without 4059 itself that is 2493, so 4059 is deficient (2493 is less than 4059). Euler's totient φ(4059) = 2400 numbers up to 4059 share no factor with it.
- 4
The digits of 4059 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 64 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4059 = 3^{2} \times 11 \times 41 \]4059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 6552 |
| Euler totient φ(n) | 2400 |
| Square | 16475481 |
| Cube | 66873977379 |
| Square root | 63.710282 (= 3√451) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 64 |
| Scientific notation | 4.059 × |
4059 in other forms
| Form | Value |
|---|---|
| In words | four thousand and fifty-nine |
| Binary (base 2) | 111111011011 |
| Octal (base 8) | 7733 |
| Hexadecimal (base 16) | FDB |
| Base 3 | 12120100 |
| As time | 4059 seconds = 1 h 7 min 39 s |
Is 4059 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 (4059 ÷ 3 = 1353) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (4059 ÷ 9 = 451) | 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 | Yes (4059 ÷ 11 = 369) | 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 4059 a prime number?
No. 4059 = × 11 × 41, so it is divisible by 3.
What are the factors of 4059?
1, 3, 9, 11, 33, 41, 99, 123, 369, 451, 1353, 4059.
What is 4059 in binary?
111111011011 (hexadecimal FDB, octal 7733).
What is the square root of 4059?
About 63.7103, exactly 3√451.
Is 4059 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 4059?
It is a composite number with 12 divisors.