The number 46581
46581 is a composite number with 4 divisors. Its prime factorisation is 3 × 15527. Divisors (4): 1, 3, 15527, 46581.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46581: a semiprime: 3 × 15527, the product of two primes.
- 2
46581 is composite. Its prime factorisation is
- 3
The divisors add up to 62112; without 46581 itself that is 15531, so 46581 is deficient (15531 is less than 46581). Euler's totient φ(46581) = 31052 numbers up to 46581 share no factor with it.
- 4
The digits of 46581 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 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46581 = 3 \times 15527 \]
46581 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 62112 |
| Euler totient φ(n) | 31052 |
| Square | 2169789561 |
| Cube | 101070967540941 |
| Square root | 215.826319 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.6581 × |
46581 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and eighty-one |
| Binary (base 2) | 1011010111110101 |
| Octal (base 8) | 132765 |
| Hexadecimal (base 16) | B5F5 |
| Base 3 | 2100220020 |
| As time | 46581 seconds = 12 h 56 min 21 s |
Is 46581 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 (46581 ÷ 3 = 15527) | 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 3) | 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 5) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46581 a prime number?
No. 46581 = 3 × 15527, so it is divisible by 3.
What are the factors of 46581?
1, 3, 15527, 46581.
What is 46581 in binary?
1011010111110101 (hexadecimal B5F5, octal 132765).
What is the square root of 46581?
About 215.8263.
Is 46581 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46581?
46581 is a semiprime: 3 × 15527, the product of two primes.