The number 46230
46230 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 23 × 67. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 23, 30, 46, 67, 69, 115, 134, 138, 201 … 46230.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46230: a Harshad number: divisible by its digit sum 15.
- 2
46230 is composite. Its prime factorisation is
- 3
The divisors add up to 117504; without 46230 itself that is 71274, so 46230 is abundant (71274 is more than 46230). Euler's totient φ(46230) = 11616 numbers up to 46230 share no factor with it.
- 4
The digits of 46230 add up to 15, 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
\[ 46230 = 2 \times 3 \times 5 \times 23 \times 67 \]
46230 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 117504 |
| Euler totient φ(n) | 11616 |
| Square | 2137212900 |
| Cube | 98803352367000 |
| Square root | 215.011628 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.623 × |
46230 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand two hundred and thirty |
| Binary (base 2) | 1011010010010110 |
| Octal (base 8) | 132226 |
| Hexadecimal (base 16) | B496 |
| Base 3 | 2100102020 |
| As time | 46230 seconds = 12 h 50 min 30 s |
Is 46230 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46230 ÷ 2 = 23115) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46230 ÷ 3 = 15410) | 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 (46230 ÷ 5 = 9246) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (46230 ÷ 6 = 7705) | 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 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 (46230 ÷ 10 = 4623) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 46230 a prime number?
No. 46230 = 2 × 3 × 5 × 23 × 67, so it is divisible by 2.
What are the factors of 46230?
1, 2, 3, 5, 6, 10, 15, 23, 30, 46, 67, 69, 115, 134, 138, 201, 230, 335, 345, 402, 670, 690, 1005, 1541, 2010, 3082, 4623, 7705, 9246, 15410, 23115, 46230.
What is 46230 in binary?
1011010010010110 (hexadecimal B496, octal 132226).
What is the square root of 46230?
About 215.0116.
Is 46230 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 46230?
46230 is a Harshad number: divisible by its digit sum 15.