The number 14152
14152 is a composite number with 16 divisors. Its prime factorisation is × 29 × 61. Divisors (16): 1, 2, 4, 8, 29, 58, 61, 116, 122, 232, 244, 488, 1769, 3538, 7076, 14152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14152 is composite. Its prime factorisation is
- 3
The divisors add up to 27900; without 14152 itself that is 13748, so 14152 is deficient (13748 is less than 14152). Euler's totient φ(14152) = 6720 numbers up to 14152 share no factor with it.
- 4
The digits of 14152 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 58 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14152 = 2^{3} \times 29 \times 61 \]14152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 27900 |
| Euler totient φ(n) | 6720 |
| Square | 200279104 |
| Cube | 2834349879808 |
| Square root | 118.962179 (= 2√3538) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4152 × |
14152 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand one hundred and fifty-two |
| Binary (base 2) | 11011101001000 |
| Octal (base 8) | 33510 |
| Hexadecimal (base 16) | 3748 |
| Base 3 | 201102011 |
| As time | 14152 seconds = 3 h 55 min 52 s |
Is 14152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14152 ÷ 2 = 7076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14152 ÷ 4 = 3538) | 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 4) | 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 | Yes (14152 ÷ 8 = 1769) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14152 a prime number?
No. 14152 = × 29 × 61, so it is divisible by 2.
What are the factors of 14152?
1, 2, 4, 8, 29, 58, 61, 116, 122, 232, 244, 488, 1769, 3538, 7076, 14152.
What is 14152 in binary?
11011101001000 (hexadecimal 3748, octal 33510).
What is the square root of 14152?
About 118.9622, exactly 2√3538.
Is 14152 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 14152?
It is a composite number with 16 divisors.