The number 23141
23141 is a composite number with 4 divisors. Its prime factorisation is 73 × 317. Divisors (4): 1, 73, 317, 23141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 23141: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 317, the product of two primes.
- 2
23141 is composite. Its prime factorisation is
- 3
The divisors add up to 23532; without 23141 itself that is 391, so 23141 is deficient (391 is less than 23141). Euler's totient φ(23141) = 22752 numbers up to 23141 share no factor with it.
- 4
The digits of 23141 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 82 steps to reach 1.
LaTeX source of the formulas on this page
\[ 23141 = 73 \times 317 \]
23141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 23532 |
| Euler totient φ(n) | 22752 |
| Square | 535505881 |
| Cube | 12392141592221 |
| Square root | 152.121662 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 82 |
| Scientific notation | 2.3141 × |
23141 in other forms
| Form | Value |
|---|---|
| In words | twenty-three thousand one hundred and forty-one |
| Binary (base 2) | 101101001100101 |
| Octal (base 8) | 55145 |
| Hexadecimal (base 16) | 5A65 |
| Base 3 | 1011202002 |
| As time | 23141 seconds = 6 h 25 min 41 s |
Is 23141 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 1) | 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 | 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 5) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 23141 a prime number?
No. 23141 = 73 × 317, so it is divisible by 73.
What are the factors of 23141?
1, 73, 317, 23141.
What is 23141 in binary?
101101001100101 (hexadecimal 5A65, octal 55145).
What is the square root of 23141?
About 152.1217.
Is 23141 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 23141?
23141 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 73 × 317, the product of two primes.