The number 15050
15050 is a composite number with 24 divisors. Its prime factorisation is 2 × × 7 × 43. Divisors (24): 1, 2, 5, 7, 10, 14, 25, 35, 43, 50, 70, 86, 175, 215, 301, 350 … 15050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15050 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15050 is composite. Its prime factorisation is
- 3
The divisors add up to 32736; without 15050 itself that is 17686, so 15050 is abundant (17686 is more than 15050). Euler's totient φ(15050) = 5040 numbers up to 15050 share no factor with it.
- 4
The digits of 15050 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15050 = 2 \times 5^{2} \times 7 \times 43 \]15050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 32736 |
| Euler totient φ(n) | 5040 |
| Square | 226502500 |
| Cube | 3408862625000 |
| Square root | 122.678441 (= 5√602) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.505 × |
15050 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand and fifty |
| Binary (base 2) | 11101011001010 |
| Octal (base 8) | 35312 |
| Hexadecimal (base 16) | 3ACA |
| Base 3 | 202122102 |
| As time | 15050 seconds = 4 h 10 min 50 s |
Is 15050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15050 ÷ 2 = 7525) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (15050 ÷ 5 = 3010) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (15050 ÷ 7 = 2150) | 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 2) | 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 | Yes (15050 ÷ 10 = 1505) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15050 a prime number?
No. 15050 = 2 × × 7 × 43, so it is divisible by 2.
What are the factors of 15050?
1, 2, 5, 7, 10, 14, 25, 35, 43, 50, 70, 86, 175, 215, 301, 350, 430, 602, 1075, 1505, 2150, 3010, 7525, 15050.
What is 15050 in binary?
11101011001010 (hexadecimal 3ACA, octal 35312).
What is the square root of 15050?
About 122.6784, exactly 5√602.
Is 15050 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 15050?
It is a composite number with 24 divisors.