The number 43561
43561 is a composite number with 8 divisors. Its prime factorisation is Ć 127. Divisors (8): 1, 7, 49, 127, 343, 889, 6223, 43561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
43561 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
43561 is composite. Its prime factorisation is
- 3
The divisors add up to 51200; without 43561 itself that is 7639, so 43561 is deficient (7639 is less than 43561). Euler's totient Ļ(43561) = 37044 numbers up to 43561 share no factor with it.
- 4
The digits of 43561 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 43561 = 7^{3} \times 127 \]43561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 51200 |
| Euler totient Ļ(n) | 37044 |
| Square | 1897560721 |
| Cube | 82659642567481 |
| Square root | 208.712721 (= 7ā889) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 176 |
| Scientific notation | 4.3561 Ć |
43561 in other forms
| Form | Value |
|---|---|
| In words | forty-three thousand five hundred and sixty-one |
| Binary (base 2) | 1010101000101001 |
| Octal (base 8) | 125051 |
| Hexadecimal (base 16) | AA29 |
| Base 3 | 2012202101 |
| As time | 43561 seconds = 12 h 6 min 1 s |
Is 43561 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 | Yes (43561 Ć· 7 = 6223) | 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 1) | 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 1) | 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 43561 a prime number?
No. 43561 = Ć 127, so it is divisible by 7.
What are the factors of 43561?
1, 7, 49, 127, 343, 889, 6223, 43561.
What is 43561 in binary?
1010101000101001 (hexadecimal AA29, octal 125051).
What is the square root of 43561?
About 208.7127, exactly 7ā889.
Is 43561 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 43561?
It is a composite number with 8 divisors.