The number 46050
46050 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 307. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 307, 614, 921, 1535 … 46050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 46050: a Harshad number: divisible by its digit sum 15.
- 2
46050 is composite. Its prime factorisation is
- 3
The divisors add up to 114576; without 46050 itself that is 68526, so 46050 is abundant (68526 is more than 46050). Euler's totient φ(46050) = 12240 numbers up to 46050 share no factor with it.
- 4
The digits of 46050 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 46050 = 2 \times 3 \times 5^{2} \times 307 \]46050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 114576 |
| Euler totient φ(n) | 12240 |
| Square | 2120602500 |
| Cube | 97653745125000 |
| Square root | 214.592637 (= 5√1842) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 57 |
| Scientific notation | 4.605 × |
46050 in other forms
| Form | Value |
|---|---|
| In words | forty-six thousand and fifty |
| Binary (base 2) | 1011001111100010 |
| Octal (base 8) | 131742 |
| Hexadecimal (base 16) | B3E2 |
| Base 3 | 2100011120 |
| As time | 46050 seconds = 12 h 47 min 30 s |
Is 46050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (46050 ÷ 2 = 23025) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (46050 ÷ 3 = 15350) | 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 (46050 ÷ 5 = 9210) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (46050 ÷ 6 = 7675) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (46050 ÷ 10 = 4605) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 46050 a prime number?
No. 46050 = 2 × 3 × × 307, so it is divisible by 2.
What are the factors of 46050?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 307, 614, 921, 1535, 1842, 3070, 4605, 7675, 9210, 15350, 23025, 46050.
What is 46050 in binary?
1011001111100010 (hexadecimal B3E2, octal 131742).
What is the square root of 46050?
About 214.5926, exactly 5√1842.
Is 46050 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 46050?
46050 is a Harshad number: divisible by its digit sum 15.