The number 23051
23051 is a composite number with 8 divisors. Its prime factorisation is 7 × 37 × 89. Divisors (8): 1, 7, 37, 89, 259, 623, 3293, 23051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
23051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
23051 is composite. Its prime factorisation is
- 3
The divisors add up to 27360; without 23051 itself that is 4309, so 23051 is deficient (4309 is less than 23051). Euler's totient φ(23051) = 19008 numbers up to 23051 share no factor with it.
- 4
The digits of 23051 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 175 steps to reach 1.
LaTeX source of the formulas on this page
\[ 23051 = 7 \times 37 \times 89 \]
23051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 27360 |
| Euler totient φ(n) | 19008 |
| Square | 531348601 |
| Cube | 12248116601651 |
| Square root | 151.825558 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 175 |
| Scientific notation | 2.3051 × |
23051 in other forms
| Form | Value |
|---|---|
| In words | twenty-three thousand and fifty-one |
| Binary (base 2) | 101101000001011 |
| Octal (base 8) | 55013 |
| Hexadecimal (base 16) | 5A0B |
| Base 3 | 1011121202 |
| As time | 23051 seconds = 6 h 24 min 11 s |
Is 23051 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (23051 ÷ 7 = 3293) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 23051 a prime number?
No. 23051 = 7 × 37 × 89, so it is divisible by 7.
What are the factors of 23051?
1, 7, 37, 89, 259, 623, 3293, 23051.
What is 23051 in binary?
101101000001011 (hexadecimal 5A0B, octal 55013).
What is the square root of 23051?
About 151.8256.
Is 23051 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 23051?
It is a composite number with 8 divisors.