The number 10476
10476 is a composite number with 24 divisors. Its prime factorisation is × × 97. Divisors (24): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 97, 108, 194, 291, 388 … 10476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10476: a Harshad number: divisible by its digit sum 18.
- 2
10476 is composite. Its prime factorisation is
- 3
The divisors add up to 27440; without 10476 itself that is 16964, so 10476 is abundant (16964 is more than 10476). Euler's totient φ(10476) = 3456 numbers up to 10476 share no factor with it.
- 4
The digits of 10476 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 104 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10476 = 2^{2} \times 3^{3} \times 97 \]10476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 27440 |
| Euler totient φ(n) | 3456 |
| Square | 109746576 |
| Cube | 1149705130176 |
| Square root | 102.352333 (= 6√291) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 104 |
| Scientific notation | 1.0476 × |
10476 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and seventy-six |
| Binary (base 2) | 10100011101100 |
| Octal (base 8) | 24354 |
| Hexadecimal (base 16) | 28EC |
| Base 3 | 112101000 |
| As time | 10476 seconds = 2 h 54 min 36 s |
Is 10476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10476 ÷ 2 = 5238) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10476 ÷ 3 = 3492) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (10476 ÷ 4 = 2619) | 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 (10476 ÷ 6 = 1746) | 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 | Yes (10476 ÷ 9 = 1164) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (10476 ÷ 12 = 873) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10476 a prime number?
No. 10476 = × × 97, so it is divisible by 2.
What are the factors of 10476?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 97, 108, 194, 291, 388, 582, 873, 1164, 1746, 2619, 3492, 5238, 10476.
What is 10476 in binary?
10100011101100 (hexadecimal 28EC, octal 24354).
What is the square root of 10476?
About 102.3523, exactly 6√291.
Is 10476 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 10476?
10476 is a Harshad number: divisible by its digit sum 18.