The number 23691
23691 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 149. Divisors (8): 1, 3, 53, 149, 159, 447, 7897, 23691.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
23691 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
23691 is composite. Its prime factorisation is
- 3
The divisors add up to 32400; without 23691 itself that is 8709, so 23691 is deficient (8709 is less than 23691). Euler's totient φ(23691) = 15392 numbers up to 23691 share no factor with it.
- 4
The digits of 23691 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 23691 = 3 \times 53 \times 149 \]
23691 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 32400 |
| Euler totient φ(n) | 15392 |
| Square | 561263481 |
| Cube | 13296893128371 |
| Square root | 153.918810 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 74 |
| Scientific notation | 2.3691 × |
23691 in other forms
| Form | Value |
|---|---|
| In words | twenty-three thousand six hundred and ninety-one |
| Binary (base 2) | 101110010001011 |
| Octal (base 8) | 56213 |
| Hexadecimal (base 16) | 5C8B |
| Base 3 | 1012111110 |
| As time | 23691 seconds = 6 h 34 min 51 s |
Is 23691 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 | Yes (23691 ÷ 3 = 7897) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 23691 a prime number?
No. 23691 = 3 × 53 × 149, so it is divisible by 3.
What are the factors of 23691?
1, 3, 53, 149, 159, 447, 7897, 23691.
What is 23691 in binary?
101110010001011 (hexadecimal 5C8B, octal 56213).
What is the square root of 23691?
About 153.9188.
Is 23691 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 23691?
It is a composite number with 8 divisors.