The number 20451
20451 is a composite number with 8 divisors. Its prime factorisation is 3 × 17 × 401. Divisors (8): 1, 3, 17, 51, 401, 1203, 6817, 20451.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20451 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20451 is composite. Its prime factorisation is
- 3
The divisors add up to 28944; without 20451 itself that is 8493, so 20451 is deficient (8493 is less than 20451). Euler's totient φ(20451) = 12800 numbers up to 20451 share no factor with it.
- 4
The digits of 20451 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 61 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20451 = 3 \times 17 \times 401 \]
20451 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 28944 |
| Euler totient φ(n) | 12800 |
| Square | 418243401 |
| Cube | 8553495793851 |
| Square root | 143.006993 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 61 |
| Scientific notation | 2.0451 × |
20451 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand four hundred and fifty-one |
| Binary (base 2) | 100111111100011 |
| Octal (base 8) | 47743 |
| Hexadecimal (base 16) | 4FE3 |
| Base 3 | 1001001110 |
| As time | 20451 seconds = 5 h 40 min 51 s |
Is 20451 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (20451 ÷ 3 = 6817) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20451 a prime number?
No. 20451 = 3 × 17 × 401, so it is divisible by 3.
What are the factors of 20451?
1, 3, 17, 51, 401, 1203, 6817, 20451.
What is 20451 in binary?
100111111100011 (hexadecimal 4FE3, octal 47743).
What is the square root of 20451?
About 143.0070.
Is 20451 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 20451?
It is a composite number with 8 divisors.