The number 56476
56476 is a composite number with 12 divisors. Its prime factorisation is × 7 × 2017. Divisors (12): 1, 2, 4, 7, 14, 28, 2017, 4034, 8068, 14119, 28238, 56476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 56476: a Harshad number: divisible by its digit sum 28.
- 2
56476 is composite. Its prime factorisation is
- 3
The divisors add up to 113008; without 56476 itself that is 56532, so 56476 is abundant (56532 is more than 56476). Euler's totient φ(56476) = 24192 numbers up to 56476 share no factor with it.
- 4
The digits of 56476 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56476 = 2^{2} \times 7 \times 2017 \]56476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 113008 |
| Euler totient φ(n) | 24192 |
| Square | 3189538576 |
| Cube | 180132380618176 |
| Square root | 237.646797 (= 2√14119) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.6476 × |
56476 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand four hundred and seventy-six |
| Binary (base 2) | 1101110010011100 |
| Octal (base 8) | 156234 |
| Hexadecimal (base 16) | DC9C |
| Base 3 | 2212110201 |
| As time | 56476 seconds = 15 h 41 min 16 s |
Is 56476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56476 ÷ 2 = 28238) | 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 (56476 ÷ 4 = 14119) | 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 (56476 ÷ 7 = 8068) | 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 1) | 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 2) | 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 56476 a prime number?
No. 56476 = × 7 × 2017, so it is divisible by 2.
What are the factors of 56476?
1, 2, 4, 7, 14, 28, 2017, 4034, 8068, 14119, 28238, 56476.
What is 56476 in binary?
1101110010011100 (hexadecimal DC9C, octal 156234).
What is the square root of 56476?
About 237.6468, exactly 2√14119.
Is 56476 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 56476?
56476 is a Harshad number: divisible by its digit sum 28.