The number 20481
20481 is a composite number with 4 divisors. Its prime factorisation is 3 × 6827. Divisors (4): 1, 3, 6827, 20481.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20481: a semiprime: 3 × 6827, the product of two primes.
- 2
20481 is composite. Its prime factorisation is
- 3
The divisors add up to 27312; without 20481 itself that is 6831, so 20481 is deficient (6831 is less than 20481). Euler's totient φ(20481) = 13652 numbers up to 20481 share no factor with it.
- 4
The digits of 20481 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 180 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20481 = 3 \times 6827 \]
20481 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 27312 |
| Euler totient φ(n) | 13652 |
| Square | 419471361 |
| Cube | 8591192944641 |
| Square root | 143.111844 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 180 |
| Scientific notation | 2.0481 × |
20481 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand four hundred and eighty-one |
| Binary (base 2) | 101000000000001 |
| Octal (base 8) | 50001 |
| Hexadecimal (base 16) | 5001 |
| Base 3 | 1001002120 |
| As time | 20481 seconds = 5 h 41 min 21 s |
Is 20481 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 (20481 ÷ 3 = 6827) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | 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 6) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20481 a prime number?
No. 20481 = 3 × 6827, so it is divisible by 3.
What are the factors of 20481?
1, 3, 6827, 20481.
What is 20481 in binary?
101000000000001 (hexadecimal 5001, octal 50001).
What is the square root of 20481?
About 143.1118.
Is 20481 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 20481?
20481 is a semiprime: 3 × 6827, the product of two primes.