The number 46580
46580 is a composite number with 24 divisors. Its prime factorisation is × 5 × 17 × 137. Divisors (24): 1, 2, 4, 5, 10, 17, 20, 34, 68, 85, 137, 170, 274, 340, 548, 685 … 46580.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46580 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46580 is composite. Its prime factorisation is
- 3
The divisors add up to 104328; without 46580 itself that is 57748, so 46580 is abundant (57748 is more than 46580). Euler's totient φ(46580) = 17408 numbers up to 46580 share no factor with it.
- 4
The digits of 46580 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46580 = 2^{2} \times 5 \times 17 \times 137 \]46580 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 104328 |
| Euler totient φ(n) | 17408 |
| Square | 2169696400 |
| Cube | 101064458312000 |
| Square root | 215.824002 (= 2√11645) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.658 × |
46580 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and eighty |
| Binary (base 2) | 1011010111110100 |
| Octal (base 8) | 132764 |
| Hexadecimal (base 16) | B5F4 |
| Base 3 | 2100220012 |
| As time | 46580 seconds = 12 h 56 min 20 s |
Is 46580 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46580 ÷ 2 = 23290) | 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 | Yes (46580 ÷ 4 = 11645) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (46580 ÷ 5 = 9316) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (46580 ÷ 10 = 4658) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46580 a prime number?
No. 46580 = × 5 × 17 × 137, so it is divisible by 2.
What are the factors of 46580?
1, 2, 4, 5, 10, 17, 20, 34, 68, 85, 137, 170, 274, 340, 548, 685, 1370, 2329, 2740, 4658, 9316, 11645, 23290, 46580.
What is 46580 in binary?
1011010111110100 (hexadecimal B5F4, octal 132764).
What is the square root of 46580?
About 215.8240, exactly 2√11645.
Is 46580 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 46580?
It is a composite number with 24 divisors.