The number 46563
46563 is a composite number with 16 divisors. Its prime factorisation is 3 × 11 × 17 × 83. Divisors (16): 1, 3, 11, 17, 33, 51, 83, 187, 249, 561, 913, 1411, 2739, 4233, 15521, 46563.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46563 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46563 is composite. Its prime factorisation is
- 3
The divisors add up to 72576; without 46563 itself that is 26013, so 46563 is deficient (26013 is less than 46563). Euler's totient φ(46563) = 26240 numbers up to 46563 share no factor with it.
- 4
The digits of 46563 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46563 = 3 \times 11 \times 17 \times 83 \]
46563 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 72576 |
| Euler totient φ(n) | 26240 |
| Square | 2168112969 |
| Cube | 100953844175547 |
| Square root | 215.784615 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.6563 × |
46563 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and sixty-three |
| Binary (base 2) | 1011010111100011 |
| Octal (base 8) | 132743 |
| Hexadecimal (base 16) | B5E3 |
| Base 3 | 2100212120 |
| As time | 46563 seconds = 12 h 56 min 3 s |
Is 46563 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 | Yes (46563 ÷ 3 = 15521) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (46563 ÷ 11 = 4233) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46563 a prime number?
No. 46563 = 3 × 11 × 17 × 83, so it is divisible by 3.
What are the factors of 46563?
1, 3, 11, 17, 33, 51, 83, 187, 249, 561, 913, 1411, 2739, 4233, 15521, 46563.
What is 46563 in binary?
1011010111100011 (hexadecimal B5E3, octal 132743).
What is the square root of 46563?
About 215.7846.
Is 46563 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46563?
It is a composite number with 16 divisors.