The number 32476
32476 is a composite number with 12 divisors. Its prime factorisation is × 23 × 353. Divisors (12): 1, 2, 4, 23, 46, 92, 353, 706, 1412, 8119, 16238, 32476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
32476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
32476 is composite. Its prime factorisation is
- 3
The divisors add up to 59472; without 32476 itself that is 26996, so 32476 is deficient (26996 is less than 32476). Euler's totient φ(32476) = 15488 numbers up to 32476 share no factor with it.
- 4
The digits of 32476 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 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32476 = 2^{2} \times 23 \times 353 \]32476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 59472 |
| Euler totient φ(n) | 15488 |
| Square | 1054690576 |
| Cube | 34252131146176 |
| Square root | 180.210987 (= 2√8119) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 67 |
| Scientific notation | 3.2476 × |
32476 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand four hundred and seventy-six |
| Binary (base 2) | 111111011011100 |
| Octal (base 8) | 77334 |
| Hexadecimal (base 16) | 7EDC |
| Base 3 | 1122112211 |
| As time | 32476 seconds = 9 h 1 min 16 s |
Is 32476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32476 ÷ 2 = 16238) | 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 (32476 ÷ 4 = 8119) | 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 | No (remainder 3) | 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 | No (remainder 4) | 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 32476 a prime number?
No. 32476 = × 23 × 353, so it is divisible by 2.
What are the factors of 32476?
1, 2, 4, 23, 46, 92, 353, 706, 1412, 8119, 16238, 32476.
What is 32476 in binary?
111111011011100 (hexadecimal 7EDC, octal 77334).
What is the square root of 32476?
About 180.2110, exactly 2√8119.
Is 32476 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 32476?
It is a composite number with 12 divisors.