The number 15105
15105 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 19 × 53. Divisors (16): 1, 3, 5, 15, 19, 53, 57, 95, 159, 265, 285, 795, 1007, 3021, 5035, 15105.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15105 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15105 is composite. Its prime factorisation is
- 3
The divisors add up to 25920; without 15105 itself that is 10815, so 15105 is deficient (10815 is less than 15105). Euler's totient φ(15105) = 7488 numbers up to 15105 share no factor with it.
- 4
The digits of 15105 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15105 = 3 \times 5 \times 19 \times 53 \]
15105 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 25920 |
| Euler totient φ(n) | 7488 |
| Square | 228161025 |
| Cube | 3446372282625 |
| Square root | 122.902400 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.5105 × |
15105 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and five |
| Binary (base 2) | 11101100000001 |
| Octal (base 8) | 35401 |
| Hexadecimal (base 16) | 3B01 |
| Base 3 | 202201110 |
| As time | 15105 seconds = 4 h 11 min 45 s |
Is 15105 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 (15105 ÷ 3 = 5035) | 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 | Yes (15105 ÷ 5 = 3021) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15105 a prime number?
No. 15105 = 3 × 5 × 19 × 53, so it is divisible by 3.
What are the factors of 15105?
1, 3, 5, 15, 19, 53, 57, 95, 159, 265, 285, 795, 1007, 3021, 5035, 15105.
What is 15105 in binary?
11101100000001 (hexadecimal 3B01, octal 35401).
What is the square root of 15105?
About 122.9024.
Is 15105 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15105?
It is a composite number with 16 divisors.