The number 20476
20476 is a composite number with 6 divisors. Its prime factorisation is × 5119. Divisors (6): 1, 2, 4, 5119, 10238, 20476.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20476 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20476 is composite. Its prime factorisation is
- 3
The divisors add up to 35840; without 20476 itself that is 15364, so 20476 is deficient (15364 is less than 20476). Euler's totient φ(20476) = 10236 numbers up to 20476 share no factor with it.
- 4
The digits of 20476 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20476 = 2^{2} \times 5119 \]20476 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 35840 |
| Euler totient φ(n) | 10236 |
| Square | 419266576 |
| Cube | 8584902410176 |
| Square root | 143.094374 (= 2√5119) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 118 |
| Scientific notation | 2.0476 × |
20476 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand four hundred and seventy-six |
| Binary (base 2) | 100111111111100 |
| Octal (base 8) | 47774 |
| Hexadecimal (base 16) | 4FFC |
| Base 3 | 1001002101 |
| As time | 20476 seconds = 5 h 41 min 16 s |
Is 20476 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20476 ÷ 2 = 10238) | 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 (20476 ÷ 4 = 5119) | 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 1) | 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 5) | 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 20476 a prime number?
No. 20476 = × 5119, so it is divisible by 2.
What are the factors of 20476?
1, 2, 4, 5119, 10238, 20476.
What is 20476 in binary?
100111111111100 (hexadecimal 4FFC, octal 47774).
What is the square root of 20476?
About 143.0944, exactly 2√5119.
Is 20476 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 20476?
It is a composite number with 6 divisors.