The number 21541
21541 is a composite number with 4 divisors. Its prime factorisation is 13 × 1657. Divisors (4): 1, 13, 1657, 21541.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 21541: a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1657, the product of two primes.
- 2
21541 is composite. Its prime factorisation is
- 3
The divisors add up to 23212; without 21541 itself that is 1671, so 21541 is deficient (1671 is less than 21541). Euler's totient φ(21541) = 19872 numbers up to 21541 share no factor with it.
- 4
The digits of 21541 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 149 steps to reach 1.
LaTeX source of the formulas on this page
\[ 21541 = 13 \times 1657 \]
21541 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 23212 |
| Euler totient φ(n) | 19872 |
| Square | 464014681 |
| Cube | 9995340243421 |
| Square root | 146.768525 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 149 |
| Scientific notation | 2.1541 × |
21541 in other forms
| Form | Value |
|---|---|
| In words | twenty-one thousand five hundred and forty-one |
| Binary (base 2) | 101010000100101 |
| Octal (base 8) | 52045 |
| Hexadecimal (base 16) | 5425 |
| Base 3 | 1002112211 |
| As time | 21541 seconds = 5 h 59 min 1 s |
Is 21541 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 21541 a prime number?
No. 21541 = 13 × 1657, so it is divisible by 13.
What are the factors of 21541?
1, 13, 1657, 21541.
What is 21541 in binary?
101010000100101 (hexadecimal 5425, octal 52045).
What is the square root of 21541?
About 146.7685.
Is 21541 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 21541?
21541 is a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1657, the product of two primes.