The number 10059
10059 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 479. Divisors (8): 1, 3, 7, 21, 479, 1437, 3353, 10059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10059 is composite. Its prime factorisation is
- 3
The divisors add up to 15360; without 10059 itself that is 5301, so 10059 is deficient (5301 is less than 10059). Euler's totient φ(10059) = 5736 numbers up to 10059 share no factor with it.
- 4
The digits of 10059 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10059 = 3 \times 7 \times 479 \]
10059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15360 |
| Euler totient φ(n) | 5736 |
| Square | 101183481 |
| Cube | 1017804635379 |
| Square root | 100.294566 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 135 |
| Scientific notation | 1.0059 × |
10059 in other forms
| Form | Value |
|---|---|
| In words | ten thousand and fifty-nine |
| Binary (base 2) | 10011101001011 |
| Octal (base 8) | 23513 |
| Hexadecimal (base 16) | 274B |
| Base 3 | 111210120 |
| As time | 10059 seconds = 2 h 47 min 39 s |
Is 10059 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 (10059 ÷ 3 = 3353) | 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 | Yes (10059 ÷ 7 = 1437) | 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 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 5) | 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 10059 a prime number?
No. 10059 = 3 × 7 × 479, so it is divisible by 3.
What are the factors of 10059?
1, 3, 7, 21, 479, 1437, 3353, 10059.
What is 10059 in binary?
10011101001011 (hexadecimal 274B, octal 23513).
What is the square root of 10059?
About 100.2946.
Is 10059 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 10059?
It is a composite number with 8 divisors.