The number 476
476 is a composite number with 12 divisors. Its prime factorisation is × 7 × 17. Divisors (12): 1, 2, 4, 7, 14, 17, 28, 34, 68, 119, 238, 476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 476: a Harshad number: divisible by its digit sum 17.
- 2
476 is composite. Its prime factorisation is
- 3
The divisors add up to 1008; without 476 itself that is 532, so 476 is abundant (532 is more than 476). Euler's totient φ(476) = 192 numbers up to 476 share no factor with it.
- 4
The digits of 476 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 35 steps to reach 1.
LaTeX source of the formulas on this page
\[ 476 = 2^{2} \times 7 \times 17 \]476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 1008 |
| Euler totient φ(n) | 192 |
| Square | 226576 |
| Cube | 107850176 |
| Square root | 21.817424 (= 2√119) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 35 |
| Scientific notation | 4.76 × |
476 in other forms
| Form | Value |
|---|---|
| In words | four hundred and seventy-six |
| Roman numerals | CDLXXVI |
| Binary (base 2) | 111011100 |
| Octal (base 8) | 734 |
| Hexadecimal (base 16) | 1DC |
| Base 3 | 122122 |
| As time | 476 seconds = 7 min 56 s |
Is 476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (476 ÷ 2 = 238) | 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 (476 ÷ 4 = 119) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (476 ÷ 7 = 68) | 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 8) | 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 3) | 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 476 a prime number?
No. 476 = × 7 × 17, so it is divisible by 2.
What are the factors of 476?
1, 2, 4, 7, 14, 17, 28, 34, 68, 119, 238, 476.
What is 476 in binary?
111011100 (hexadecimal 1DC, octal 734).
What is the square root of 476?
About 21.8174, exactly 2√119.
What is 476 in Roman numerals?
CDLXXVI.
Is 476 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 476?
476 is a Harshad number: divisible by its digit sum 17.