The number 21261
21261 is a composite number with 8 divisors. Its prime factorisation is 3 × 19 × 373. Divisors (8): 1, 3, 19, 57, 373, 1119, 7087, 21261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
21261 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
21261 is composite. Its prime factorisation is
- 3
The divisors add up to 29920; without 21261 itself that is 8659, so 21261 is deficient (8659 is less than 21261). Euler's totient φ(21261) = 13392 numbers up to 21261 share no factor with it.
- 4
The digits of 21261 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 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 21261 = 3 \times 19 \times 373 \]
21261 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29920 |
| Euler totient φ(n) | 13392 |
| Square | 452030121 |
| Cube | 9610612402581 |
| Square root | 145.811522 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 56 |
| Scientific notation | 2.1261 × |
21261 in other forms
| Form | Value |
|---|---|
| In words | twenty-one thousand two hundred and sixty-one |
| Binary (base 2) | 101001100001101 |
| Octal (base 8) | 51415 |
| Hexadecimal (base 16) | 530D |
| Base 3 | 1002011110 |
| As time | 21261 seconds = 5 h 54 min 21 s |
Is 21261 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 (21261 ÷ 3 = 7087) | 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 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 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 9) | 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 21261 a prime number?
No. 21261 = 3 × 19 × 373, so it is divisible by 3.
What are the factors of 21261?
1, 3, 19, 57, 373, 1119, 7087, 21261.
What is 21261 in binary?
101001100001101 (hexadecimal 530D, octal 51415).
What is the square root of 21261?
About 145.8115.
Is 21261 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 21261?
It is a composite number with 8 divisors.