The number 12150
12150 is a composite number with 36 divisors. Its prime factorisation is 2 × × . Divisors (36): 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 30, 45, 50, 54, 75 … 12150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12150: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.
- 2
12150 is composite. Its prime factorisation is
- 3
The divisors add up to 33852; without 12150 itself that is 21702, so 12150 is abundant (21702 is more than 12150). Euler's totient φ(12150) = 3240 numbers up to 12150 share no factor with it.
- 4
The digits of 12150 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 63 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12150 = 2 \times 3^{5} \times 5^{2} \]12150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 33852 |
| Euler totient φ(n) | 3240 |
| Square | 147622500 |
| Cube | 1793613375000 |
| Square root | 110.227038 (= 45√6) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 63 |
| Scientific notation | 1.215 × |
12150 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand one hundred and fifty |
| Binary (base 2) | 10111101110110 |
| Octal (base 8) | 27566 |
| Hexadecimal (base 16) | 2F76 |
| Base 3 | 121200000 |
| As time | 12150 seconds = 3 h 22 min 30 s |
Is 12150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12150 ÷ 2 = 6075) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12150 ÷ 3 = 4050) | 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 (12150 ÷ 5 = 2430) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (12150 ÷ 6 = 2025) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (12150 ÷ 9 = 1350) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (12150 ÷ 10 = 1215) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12150 a prime number?
No. 12150 = 2 × × , so it is divisible by 2.
What are the factors of 12150?
1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 27, 30, 45, 50, 54, 75, 81, 90, 135, 150, 162, 225, 243, 270, 405, 450, 486, 675, 810, 1215, 1350, 2025, 2430, 4050, 6075, 12150.
What is 12150 in binary?
10111101110110 (hexadecimal 2F76, octal 27566).
What is the square root of 12150?
About 110.2270, exactly 45√6.
Is 12150 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 12150?
12150 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 9.