The number 23050
23050 is a composite number with 12 divisors. Its prime factorisation is 2 × × 461. Divisors (12): 1, 2, 5, 10, 25, 50, 461, 922, 2305, 4610, 11525, 23050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 23050: a Harshad number: divisible by its digit sum 10.
- 2
23050 is composite. Its prime factorisation is
- 3
The divisors add up to 42966; without 23050 itself that is 19916, so 23050 is deficient (19916 is less than 23050). Euler's totient φ(23050) = 9200 numbers up to 23050 share no factor with it.
- 4
The digits of 23050 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 38 steps to reach 1.
LaTeX source of the formulas on this page
\[ 23050 = 2 \times 5^{2} \times 461 \]23050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 42966 |
| Euler totient φ(n) | 9200 |
| Square | 531302500 |
| Cube | 12246522625000 |
| Square root | 151.822265 (= 5√922) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 38 |
| Scientific notation | 2.305 × |
23050 in other forms
| Form | Value |
|---|---|
| In words | twenty-three thousand and fifty |
| Binary (base 2) | 101101000001010 |
| Octal (base 8) | 55012 |
| Hexadecimal (base 16) | 5A0A |
| Base 3 | 1011121201 |
| As time | 23050 seconds = 6 h 24 min 10 s |
Is 23050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (23050 ÷ 2 = 11525) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (23050 ÷ 5 = 4610) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (23050 ÷ 10 = 2305) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 23050 a prime number?
No. 23050 = 2 × × 461, so it is divisible by 2.
What are the factors of 23050?
1, 2, 5, 10, 25, 50, 461, 922, 2305, 4610, 11525, 23050.
What is 23050 in binary?
101101000001010 (hexadecimal 5A0A, octal 55012).
What is the square root of 23050?
About 151.8223, exactly 5√922.
Is 23050 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 23050?
23050 is a Harshad number: divisible by its digit sum 10.