The number 14952
14952 is a composite number with 32 divisors. Its prime factorisation is × 3 × 7 × 89. Divisors (32): 1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 89 … 14952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14952: a Harshad number: divisible by its digit sum 21.
- 2
14952 is composite. Its prime factorisation is
- 3
The divisors add up to 43200; without 14952 itself that is 28248, so 14952 is abundant (28248 is more than 14952). Euler's totient φ(14952) = 4224 numbers up to 14952 share no factor with it.
- 4
The digits of 14952 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14952 = 2^{3} \times 3 \times 7 \times 89 \]14952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 43200 |
| Euler totient φ(n) | 4224 |
| Square | 223562304 |
| Cube | 3342703569408 |
| Square root | 122.278371 (= 2√3738) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 89 |
| Scientific notation | 1.4952 × |
14952 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and fifty-two |
| Binary (base 2) | 11101001101000 |
| Octal (base 8) | 35150 |
| Hexadecimal (base 16) | 3A68 |
| Base 3 | 202111210 |
| As time | 14952 seconds = 4 h 9 min 12 s |
Is 14952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14952 ÷ 2 = 7476) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (14952 ÷ 3 = 4984) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (14952 ÷ 4 = 3738) | 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 (14952 ÷ 6 = 2492) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (14952 ÷ 7 = 2136) | 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 (14952 ÷ 8 = 1869) | 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 | No (remainder 2) | 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 | Yes (14952 ÷ 12 = 1246) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14952 a prime number?
No. 14952 = × 3 × 7 × 89, so it is divisible by 2.
What are the factors of 14952?
1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 89, 168, 178, 267, 356, 534, 623, 712, 1068, 1246, 1869, 2136, 2492, 3738, 4984, 7476, 14952.
What is 14952 in binary?
11101001101000 (hexadecimal 3A68, octal 35150).
What is the square root of 14952?
About 122.2784, exactly 2√3738.
Is 14952 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 14952?
14952 is a Harshad number: divisible by its digit sum 21.