The number 46541
46541 is a composite number with 4 divisors. Its prime factorisation is 11 × 4231. Divisors (4): 1, 11, 4231, 46541.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46541: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 4231, the product of two primes.
- 2
46541 is composite. Its prime factorisation is
- 3
The divisors add up to 50784; without 46541 itself that is 4243, so 46541 is deficient (4243 is less than 46541). Euler's totient φ(46541) = 42300 numbers up to 46541 share no factor with it.
- 4
The digits of 46541 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46541 = 11 \times 4231 \]
46541 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50784 |
| Euler totient φ(n) | 42300 |
| Square | 2166064681 |
| Cube | 100810816318421 |
| Square root | 215.733632 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6541 × |
46541 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and forty-one |
| Binary (base 2) | 1011010111001101 |
| Octal (base 8) | 132715 |
| Hexadecimal (base 16) | B5CD |
| Base 3 | 2100211202 |
| As time | 46541 seconds = 12 h 55 min 41 s |
Is 46541 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 | No (remainder 5) | 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 2) | 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 | Yes (46541 ÷ 11 = 4231) | 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 46541 a prime number?
No. 46541 = 11 × 4231, so it is divisible by 11.
What are the factors of 46541?
1, 11, 4231, 46541.
What is 46541 in binary?
1011010111001101 (hexadecimal B5CD, octal 132715).
What is the square root of 46541?
About 215.7336.
Is 46541 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 46541?
46541 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 11 × 4231, the product of two primes.