The number 13059
13059 is a composite number with 6 divisors. Its prime factorisation is × 1451. Divisors (6): 1, 3, 9, 1451, 4353, 13059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
13059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
13059 is composite. Its prime factorisation is
- 3
The divisors add up to 18876; without 13059 itself that is 5817, so 13059 is deficient (5817 is less than 13059). Euler's totient φ(13059) = 8700 numbers up to 13059 share no factor with it.
- 4
The digits of 13059 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 169 steps to reach 1.
LaTeX source of the formulas on this page
\[ 13059 = 3^{2} \times 1451 \]13059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 18876 |
| Euler totient φ(n) | 8700 |
| Square | 170537481 |
| Cube | 2227048964379 |
| Square root | 114.275982 (= 3√1451) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 169 |
| Scientific notation | 1.3059 × |
13059 in other forms
| Form | Value |
|---|---|
| In words | thirteen thousand and fifty-nine |
| Binary (base 2) | 11001100000011 |
| Octal (base 8) | 31403 |
| Hexadecimal (base 16) | 3303 |
| Base 3 | 122220200 |
| As time | 13059 seconds = 3 h 37 min 39 s |
Is 13059 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 (13059 ÷ 3 = 4353) | 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 4) | 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 (13059 ÷ 9 = 1451) | 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 2) | 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 13059 a prime number?
No. 13059 = × 1451, so it is divisible by 3.
What are the factors of 13059?
1, 3, 9, 1451, 4353, 13059.
What is 13059 in binary?
11001100000011 (hexadecimal 3303, octal 31403).
What is the square root of 13059?
About 114.2760, exactly 3√1451.
Is 13059 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 13059?
It is a composite number with 6 divisors.