The number 14752
14752 is a composite number with 12 divisors. Its prime factorisation is × 461. Divisors (12): 1, 2, 4, 8, 16, 32, 461, 922, 1844, 3688, 7376, 14752.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
14752 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
14752 is composite. Its prime factorisation is
- 3
The divisors add up to 29106; without 14752 itself that is 14354, so 14752 is deficient (14354 is less than 14752). Euler's totient φ(14752) = 7360 numbers up to 14752 share no factor with it.
- 4
The digits of 14752 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14752 = 2^{5} \times 461 \]14752 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 29106 |
| Euler totient φ(n) | 7360 |
| Square | 217621504 |
| Cube | 3210352427008 |
| Square root | 121.457812 (= 4√922) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.4752 × |
14752 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and fifty-two |
| Binary (base 2) | 11100110100000 |
| Octal (base 8) | 34640 |
| Hexadecimal (base 16) | 39A0 |
| Base 3 | 202020101 |
| As time | 14752 seconds = 4 h 5 min 52 s |
Is 14752 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14752 ÷ 2 = 7376) | 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 (14752 ÷ 4 = 3688) | 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 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 (14752 ÷ 8 = 1844) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 1) | 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 14752 a prime number?
No. 14752 = × 461, so it is divisible by 2.
What are the factors of 14752?
1, 2, 4, 8, 16, 32, 461, 922, 1844, 3688, 7376, 14752.
What is 14752 in binary?
11100110100000 (hexadecimal 39A0, octal 34640).
What is the square root of 14752?
About 121.4578, exactly 4√922.
Is 14752 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 14752?
It is a composite number with 12 divisors.