The number 14732
14732 is a composite number with 12 divisors. Its prime factorisation is × 29 × 127. Divisors (12): 1, 2, 4, 29, 58, 116, 127, 254, 508, 3683, 7366, 14732.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14732: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
14732 is composite. Its prime factorisation is
- 3
The divisors add up to 26880; without 14732 itself that is 12148, so 14732 is deficient (12148 is less than 14732). Euler's totient φ(14732) = 7056 numbers up to 14732 share no factor with it.
- 4
The digits of 14732 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 133 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14732 = 2^{2} \times 29 \times 127 \]14732 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 26880 |
| Euler totient φ(n) | 7056 |
| Square | 217031824 |
| Cube | 3197312831168 |
| Square root | 121.375451 (= 2√3683) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 133 |
| Scientific notation | 1.4732 × |
14732 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand seven hundred and thirty-two |
| Binary (base 2) | 11100110001100 |
| Octal (base 8) | 34614 |
| Hexadecimal (base 16) | 398C |
| Base 3 | 202012122 |
| As time | 14732 seconds = 4 h 5 min 32 s |
Is 14732 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14732 ÷ 2 = 7366) | 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 (14732 ÷ 4 = 3683) | 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 | No (remainder 4) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14732 a prime number?
No. 14732 = × 29 × 127, so it is divisible by 2.
What are the factors of 14732?
1, 2, 4, 29, 58, 116, 127, 254, 508, 3683, 7366, 14732.
What is 14732 in binary?
11100110001100 (hexadecimal 398C, octal 34614).
What is the square root of 14732?
About 121.3755, exactly 2√3683.
Is 14732 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 14732?
14732 is a happy number: repeatedly adding the squares of its digits reaches 1.