The number 15059
15059 is a composite number with 6 divisors. Its prime factorisation is 11 Ć . Divisors (6): 1, 11, 37, 407, 1369, 15059.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15059 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15059 is composite. Its prime factorisation is
- 3
The divisors add up to 16884; without 15059 itself that is 1825, so 15059 is deficient (1825 is less than 15059). Euler's totient Ļ(15059) = 13320 numbers up to 15059 share no factor with it.
- 4
The digits of 15059 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15059 = 11 \times 37^{2} \]15059 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 16884 |
| Euler totient Ļ(n) | 13320 |
| Square | 226773481 |
| Cube | 3414981850379 |
| Square root | 122.715117 (= 37ā11) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.5059 Ć |
15059 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and fifty-nine |
| Binary (base 2) | 11101011010011 |
| Octal (base 8) | 35323 |
| Hexadecimal (base 16) | 3AD3 |
| Base 3 | 202122202 |
| As time | 15059 seconds = 4 h 10 min 59 s |
Is 15059 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 | No (remainder 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 2) | 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 (15059 Ć· 11 = 1369) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15059 a prime number?
No. 15059 = 11 Ć , so it is divisible by 11.
What are the factors of 15059?
1, 11, 37, 407, 1369, 15059.
What is 15059 in binary?
11101011010011 (hexadecimal 3AD3, octal 35323).
What is the square root of 15059?
About 122.7151, exactly 37ā11.
Is 15059 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 15059?
It is a composite number with 6 divisors.