The number 16152
16152 is a composite number with 16 divisors. Its prime factorisation is × 3 × 673. Divisors (16): 1, 2, 3, 4, 6, 8, 12, 24, 673, 1346, 2019, 2692, 4038, 5384, 8076, 16152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16152 is composite. Its prime factorisation is
- 3
The divisors add up to 40440; without 16152 itself that is 24288, so 16152 is abundant (24288 is more than 16152). Euler's totient φ(16152) = 5376 numbers up to 16152 share no factor with it.
- 4
The digits of 16152 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16152 = 2^{3} \times 3 \times 673 \]16152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 40440 |
| Euler totient φ(n) | 5376 |
| Square | 260887104 |
| Cube | 4213848503808 |
| Square root | 127.090519 (= 2√4038) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.6152 × |
16152 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand one hundred and fifty-two |
| Binary (base 2) | 11111100011000 |
| Octal (base 8) | 37430 |
| Hexadecimal (base 16) | 3F18 |
| Base 3 | 211011020 |
| As time | 16152 seconds = 4 h 29 min 12 s |
Is 16152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16152 ÷ 2 = 8076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16152 ÷ 3 = 5384) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16152 ÷ 4 = 4038) | 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 | Yes (16152 ÷ 6 = 2692) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (16152 ÷ 8 = 2019) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (16152 ÷ 12 = 1346) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16152 a prime number?
No. 16152 = × 3 × 673, so it is divisible by 2.
What are the factors of 16152?
1, 2, 3, 4, 6, 8, 12, 24, 673, 1346, 2019, 2692, 4038, 5384, 8076, 16152.
What is 16152 in binary?
11111100011000 (hexadecimal 3F18, octal 37430).
What is the square root of 16152?
About 127.0905, exactly 2√4038.
Is 16152 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 16152?
It is a composite number with 16 divisors.