The number 10472
10472 is a composite number with 32 divisors. Its prime factorisation is × 7 × 11 × 17. Divisors (32): 1, 2, 4, 7, 8, 11, 14, 17, 22, 28, 34, 44, 56, 68, 77, 88 … 10472.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10472: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.
- 2
10472 is composite. Its prime factorisation is
- 3
The divisors add up to 25920; without 10472 itself that is 15448, so 10472 is abundant (15448 is more than 10472). Euler's totient φ(10472) = 3840 numbers up to 10472 share no factor with it.
- 4
The digits of 10472 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10472 = 2^{3} \times 7 \times 11 \times 17 \]10472 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 25920 |
| Euler totient φ(n) | 3840 |
| Square | 109662784 |
| Cube | 1148388674048 |
| Square root | 102.332790 (= 2√2618) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.0472 × |
10472 in other forms
| Form | Value |
|---|---|
| In words | ten thousand four hundred and seventy-two |
| Binary (base 2) | 10100011101000 |
| Octal (base 8) | 24350 |
| Hexadecimal (base 16) | 28E8 |
| Base 3 | 112100212 |
| As time | 10472 seconds = 2 h 54 min 32 s |
Is 10472 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10472 ÷ 2 = 5236) | 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 (10472 ÷ 4 = 2618) | 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 | Yes (10472 ÷ 7 = 1496) | 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 (10472 ÷ 8 = 1309) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | Yes (10472 ÷ 11 = 952) | 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 10472 a prime number?
No. 10472 = × 7 × 11 × 17, so it is divisible by 2.
What are the factors of 10472?
1, 2, 4, 7, 8, 11, 14, 17, 22, 28, 34, 44, 56, 68, 77, 88, 119, 136, 154, 187, 238, 308, 374, 476, 616, 748, 952, 1309, 1496, 2618, 5236, 10472.
What is 10472 in binary?
10100011101000 (hexadecimal 28E8, octal 24350).
What is the square root of 10472?
About 102.3328, exactly 2√2618.
Is 10472 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 10472?
10472 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 14.