The number 15109
15109 is a composite number with 4 divisors. Its prime factorisation is 29 × 521. Divisors (4): 1, 29, 521, 15109.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15109: a semiprime: 29 × 521, the product of two primes.
- 2
15109 is composite. Its prime factorisation is
- 3
The divisors add up to 15660; without 15109 itself that is 551, so 15109 is deficient (551 is less than 15109). Euler's totient φ(15109) = 14560 numbers up to 15109 share no factor with it.
- 4
The digits of 15109 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15109 = 29 \times 521 \]
15109 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15660 |
| Euler totient φ(n) | 14560 |
| Square | 228281881 |
| Cube | 3449110940029 |
| Square root | 122.918672 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5109 × |
15109 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and nine |
| Binary (base 2) | 11101100000101 |
| Octal (base 8) | 35405 |
| Hexadecimal (base 16) | 3B05 |
| Base 3 | 202201121 |
| As time | 15109 seconds = 4 h 11 min 49 s |
Is 15109 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 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15109 a prime number?
No. 15109 = 29 × 521, so it is divisible by 29.
What are the factors of 15109?
1, 29, 521, 15109.
What is 15109 in binary?
11101100000101 (hexadecimal 3B05, octal 35405).
What is the square root of 15109?
About 122.9187.
Is 15109 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 15109?
15109 is a semiprime: 29 × 521, the product of two primes.