The number 46530
46530 is a composite number with 48 divisors. Its prime factorisation is 2 × × 5 × 11 × 47. Divisors (48): 1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 30, 33, 45, 47, 55 … 46530.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46530: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
46530 is composite. Its prime factorisation is
- 3
The divisors add up to 134784; without 46530 itself that is 88254, so 46530 is abundant (88254 is more than 46530). Euler's totient φ(46530) = 11040 numbers up to 46530 share no factor with it.
- 4
The digits of 46530 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46530 = 2 \times 3^{2} \times 5 \times 11 \times 47 \]46530 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 134784 |
| Euler totient φ(n) | 11040 |
| Square | 2165040900 |
| Cube | 100739353077000 |
| Square root | 215.708136 (= 3√5170) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.653 × |
46530 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand five hundred and thirty |
| Binary (base 2) | 1011010111000010 |
| Octal (base 8) | 132702 |
| Hexadecimal (base 16) | B5C2 |
| Base 3 | 2100211100 |
| As time | 46530 seconds = 12 h 55 min 30 s |
Is 46530 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46530 ÷ 2 = 23265) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46530 ÷ 3 = 15510) | 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 (46530 ÷ 5 = 9306) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (46530 ÷ 6 = 7755) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (46530 ÷ 9 = 5170) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (46530 ÷ 10 = 4653) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (46530 ÷ 11 = 4230) | 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 46530 a prime number?
No. 46530 = 2 × × 5 × 11 × 47, so it is divisible by 2.
What are the factors of 46530?
1, 2, 3, 5, 6, 9, 10, 11, 15, 18, 22, 30, 33, 45, 47, 55, 66, 90, 94, 99, 110, 141, 165, 198, 235, 282, 330, 423, 470, 495, 517, 705, 846, 990, 1034, 1410, 1551, 2115, 2585, 3102, 4230, 4653, 5170, 7755, 9306, 15510, 23265, 46530.
What is 46530 in binary?
1011010111000010 (hexadecimal B5C2, octal 132702).
What is the square root of 46530?
About 215.7081, exactly 3√5170.
Is 46530 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 46530?
46530 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.