The number 40561
40561 is a composite number with 4 divisors. Its prime factorisation is 47 × 863. Divisors (4): 1, 47, 863, 40561.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 40561: a semiprime: 47 × 863, the product of two primes.
- 2
40561 is composite. Its prime factorisation is
- 3
The divisors add up to 41472; without 40561 itself that is 911, so 40561 is deficient (911 is less than 40561). Euler's totient φ(40561) = 39652 numbers up to 40561 share no factor with it.
- 4
The digits of 40561 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 40561 = 47 \times 863 \]
40561 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 41472 |
| Euler totient φ(n) | 39652 |
| Square | 1645194721 |
| Cube | 66730743078481 |
| Square root | 201.397617 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 36 |
| Scientific notation | 4.0561 × |
40561 in other forms
| Form | Value |
|---|---|
| In words | forty thousand five hundred and sixty-one |
| Binary (base 2) | 1001111001110001 |
| Octal (base 8) | 117161 |
| Hexadecimal (base 16) | 9E71 |
| Base 3 | 2001122021 |
| As time | 40561 seconds = 11 h 16 min 1 s |
Is 40561 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 3) | 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 7) | 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 4) | 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 40561 a prime number?
No. 40561 = 47 × 863, so it is divisible by 47.
What are the factors of 40561?
1, 47, 863, 40561.
What is 40561 in binary?
1001111001110001 (hexadecimal 9E71, octal 117161).
What is the square root of 40561?
About 201.3976.
Is 40561 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 40561?
40561 is a semiprime: 47 × 863, the product of two primes.