The number 16541
16541 is a composite number with 8 divisors. Its prime factorisation is 7 × 17 × 139. Divisors (8): 1, 7, 17, 119, 139, 973, 2363, 16541.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16541: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.
- 2
16541 is composite. Its prime factorisation is
- 3
The divisors add up to 20160; without 16541 itself that is 3619, so 16541 is deficient (3619 is less than 16541). Euler's totient φ(16541) = 13248 numbers up to 16541 share no factor with it.
- 4
The digits of 16541 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 97 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16541 = 7 \times 17 \times 139 \]
16541 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 20160 |
| Euler totient φ(n) | 13248 |
| Square | 273604681 |
| Cube | 4525695028421 |
| Square root | 128.611819 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 97 |
| Scientific notation | 1.6541 × |
16541 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand five hundred and forty-one |
| Binary (base 2) | 100000010011101 |
| Octal (base 8) | 40235 |
| Hexadecimal (base 16) | 409D |
| Base 3 | 211200122 |
| As time | 16541 seconds = 4 h 35 min 41 s |
Is 16541 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (16541 ÷ 7 = 2363) | 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 8) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16541 a prime number?
No. 16541 = 7 × 17 × 139, so it is divisible by 7.
What are the factors of 16541?
1, 7, 17, 119, 139, 973, 2363, 16541.
What is 16541 in binary?
100000010011101 (hexadecimal 409D, octal 40235).
What is the square root of 16541?
About 128.6118.
Is 16541 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 16541?
16541 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.