The number 15150
15150 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 101. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 101, 150, 202, 303, 505 … 15150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
15150 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
15150 is composite. Its prime factorisation is
- 3
The divisors add up to 37944; without 15150 itself that is 22794, so 15150 is abundant (22794 is more than 15150). Euler's totient φ(15150) = 4000 numbers up to 15150 share no factor with it.
- 4
The digits of 15150 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 15150 = 2 \times 3 \times 5^{2} \times 101 \]15150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 37944 |
| Euler totient φ(n) | 4000 |
| Square | 229522500 |
| Cube | 3477265875000 |
| Square root | 123.085336 (= 5√606) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 84 |
| Scientific notation | 1.515 × |
15150 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand one hundred and fifty |
| Binary (base 2) | 11101100101110 |
| Octal (base 8) | 35456 |
| Hexadecimal (base 16) | 3B2E |
| Base 3 | 202210010 |
| As time | 15150 seconds = 4 h 12 min 30 s |
Is 15150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (15150 ÷ 2 = 7575) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (15150 ÷ 3 = 5050) | 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 (15150 ÷ 5 = 3030) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (15150 ÷ 6 = 2525) | 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 6) | 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 | Yes (15150 ÷ 10 = 1515) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15150 a prime number?
No. 15150 = 2 × 3 × × 101, so it is divisible by 2.
What are the factors of 15150?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 101, 150, 202, 303, 505, 606, 1010, 1515, 2525, 3030, 5050, 7575, 15150.
What is 15150 in binary?
11101100101110 (hexadecimal 3B2E, octal 35456).
What is the square root of 15150?
About 123.0853, exactly 5√606.
Is 15150 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 15150?
It is a composite number with 24 divisors.