The number 14476
14476 is a composite number with 24 divisors. Its prime factorisation is × 7 × 11 × 47. Divisors (24): 1, 2, 4, 7, 11, 14, 22, 28, 44, 47, 77, 94, 154, 188, 308, 329 … 14476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14476: a Harshad number: divisible by its digit sum 22.
- 2
14476 is composite. Its prime factorisation is
- 3
The divisors add up to 32256; without 14476 itself that is 17780, so 14476 is abundant (17780 is more than 14476). Euler's totient φ(14476) = 5520 numbers up to 14476 share no factor with it.
- 4
The digits of 14476 add up to 22, 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
\[ 14476 = 2^{2} \times 7 \times 11 \times 47 \]14476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 32256 |
| Euler totient φ(n) | 5520 |
| Square | 209554576 |
| Cube | 3033512042176 |
| Square root | 120.316250 (= 2√3619) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 58 |
| Scientific notation | 1.4476 × |
14476 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand four hundred and seventy-six |
| Binary (base 2) | 11100010001100 |
| Octal (base 8) | 34214 |
| Hexadecimal (base 16) | 388C |
| Base 3 | 201212011 |
| As time | 14476 seconds = 4 h 1 min 16 s |
Is 14476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14476 ÷ 2 = 7238) | 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 (14476 ÷ 4 = 3619) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 | Yes (14476 ÷ 7 = 2068) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (14476 ÷ 11 = 1316) | 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 14476 a prime number?
No. 14476 = × 7 × 11 × 47, so it is divisible by 2.
What are the factors of 14476?
1, 2, 4, 7, 11, 14, 22, 28, 44, 47, 77, 94, 154, 188, 308, 329, 517, 658, 1034, 1316, 2068, 3619, 7238, 14476.
What is 14476 in binary?
11100010001100 (hexadecimal 388C, octal 34214).
What is the square root of 14476?
About 120.3162, exactly 2√3619.
Is 14476 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 14476?
14476 is a Harshad number: divisible by its digit sum 22.