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