The number 12152
12152 is a composite number with 24 divisors. Its prime factorisation is × × 31. Divisors (24): 1, 2, 4, 7, 8, 14, 28, 31, 49, 56, 62, 98, 124, 196, 217, 248 … 12152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12152 is composite. Its prime factorisation is
- 3
The divisors add up to 27360; without 12152 itself that is 15208, so 12152 is abundant (15208 is more than 12152). Euler's totient φ(12152) = 5040 numbers up to 12152 share no factor with it.
- 4
The digits of 12152 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 156 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12152 = 2^{3} \times 7^{2} \times 31 \]12152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 27360 |
| Euler totient φ(n) | 5040 |
| Square | 147671104 |
| Cube | 1794499255808 |
| Square root | 110.236110 (= 14√62) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 156 |
| Scientific notation | 1.2152 × |
12152 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand one hundred and fifty-two |
| Binary (base 2) | 10111101111000 |
| Octal (base 8) | 27570 |
| Hexadecimal (base 16) | 2F78 |
| Base 3 | 121200002 |
| As time | 12152 seconds = 3 h 22 min 32 s |
Is 12152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12152 ÷ 2 = 6076) | 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 | Yes (12152 ÷ 4 = 3038) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 (12152 ÷ 7 = 1736) | 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 | Yes (12152 ÷ 8 = 1519) | 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 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12152 a prime number?
No. 12152 = × × 31, so it is divisible by 2.
What are the factors of 12152?
1, 2, 4, 7, 8, 14, 28, 31, 49, 56, 62, 98, 124, 196, 217, 248, 392, 434, 868, 1519, 1736, 3038, 6076, 12152.
What is 12152 in binary?
10111101111000 (hexadecimal 2F78, octal 27570).
What is the square root of 12152?
About 110.2361, exactly 14√62.
Is 12152 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 12152?
It is a composite number with 24 divisors.