The number 46590
46590 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1553. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1553, 3106, 4659, 7765, 9318, 15530, 23295, 46590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
46590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
46590 is composite. Its prime factorisation is
- 3
The divisors add up to 111888; without 46590 itself that is 65298, so 46590 is abundant (65298 is more than 46590). Euler's totient φ(46590) = 12416 numbers up to 46590 share no factor with it.
- 4
The digits of 46590 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46590 = 2 \times 3 \times 5 \times 1553 \]
46590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 111888 |
| Euler totient φ(n) | 12416 |
| Square | 2170628100 |
| Cube | 101129563179000 |
| Square root | 215.847168 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.659 × |
46590 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and ninety |
| Binary (base 2) | 1011010111111110 |
| Octal (base 8) | 132776 |
| Hexadecimal (base 16) | B5FE |
| Base 3 | 2100220120 |
| As time | 46590 seconds = 12 h 56 min 30 s |
Is 46590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46590 ÷ 2 = 23295) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46590 ÷ 3 = 15530) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (46590 ÷ 5 = 9318) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (46590 ÷ 6 = 7765) | 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 6) | 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 | Yes (46590 ÷ 10 = 4659) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 46590 a prime number?
No. 46590 = 2 × 3 × 5 × 1553, so it is divisible by 2.
What are the factors of 46590?
1, 2, 3, 5, 6, 10, 15, 30, 1553, 3106, 4659, 7765, 9318, 15530, 23295, 46590.
What is 46590 in binary?
1011010111111110 (hexadecimal B5FE, octal 132776).
What is the square root of 46590?
About 215.8472.
Is 46590 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 46590?
It is a composite number with 16 divisors.