The number 16476
16476 is a composite number with 12 divisors. Its prime factorisation is × 3 × 1373. Divisors (12): 1, 2, 3, 4, 6, 12, 1373, 2746, 4119, 5492, 8238, 16476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16476 is composite. Its prime factorisation is
- 3
The divisors add up to 38472; without 16476 itself that is 21996, so 16476 is abundant (21996 is more than 16476). Euler's totient φ(16476) = 5488 numbers up to 16476 share no factor with it.
- 4
The digits of 16476 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 40 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16476 = 2^{2} \times 3 \times 1373 \]16476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 38472 |
| Euler totient φ(n) | 5488 |
| Square | 271458576 |
| Cube | 4472551498176 |
| Square root | 128.358872 (= 2√4119) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 40 |
| Scientific notation | 1.6476 × |
16476 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand four hundred and seventy-six |
| Binary (base 2) | 100000001011100 |
| Octal (base 8) | 40134 |
| Hexadecimal (base 16) | 405C |
| Base 3 | 211121020 |
| As time | 16476 seconds = 4 h 34 min 36 s |
Is 16476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16476 ÷ 2 = 8238) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (16476 ÷ 3 = 5492) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (16476 ÷ 4 = 4119) | 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 | Yes (16476 ÷ 6 = 2746) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (16476 ÷ 12 = 1373) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16476 a prime number?
No. 16476 = × 3 × 1373, so it is divisible by 2.
What are the factors of 16476?
1, 2, 3, 4, 6, 12, 1373, 2746, 4119, 5492, 8238, 16476.
What is 16476 in binary?
100000001011100 (hexadecimal 405C, octal 40134).
What is the square root of 16476?
About 128.3589, exactly 2√4119.
Is 16476 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 16476?
It is a composite number with 12 divisors.