The number 69231
69231 is a composite number with 8 divisors. Its prime factorisation is 3 × 47 × 491. Divisors (8): 1, 3, 47, 141, 491, 1473, 23077, 69231.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69231 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69231 is composite. Its prime factorisation is
- 3
The divisors add up to 94464; without 69231 itself that is 25233, so 69231 is deficient (25233 is less than 69231). Euler's totient φ(69231) = 45080 numbers up to 69231 share no factor with it.
- 4
The digits of 69231 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 249 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69231 = 3 \times 47 \times 491 \]
69231 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 94464 |
| Euler totient φ(n) | 45080 |
| Square | 4792931361 |
| Cube | 331819431053391 |
| Square root | 263.117844 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 249 |
| Scientific notation | 6.9231 × |
69231 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand two hundred and thirty-one |
| Binary (base 2) | 10000111001101111 |
| Octal (base 8) | 207157 |
| Hexadecimal (base 16) | 10E6F |
| Base 3 | 10111222010 |
| As time | 69231 seconds = 19 h 13 min 51 s |
Is 69231 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 (69231 ÷ 3 = 23077) | 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 1) | 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 7) | 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 69231 a prime number?
No. 69231 = 3 × 47 × 491, so it is divisible by 3.
What are the factors of 69231?
1, 3, 47, 141, 491, 1473, 23077, 69231.
What is 69231 in binary?
10000111001101111 (hexadecimal 10E6F, octal 207157).
What is the square root of 69231?
About 263.1178.
Is 69231 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 69231?
It is a composite number with 8 divisors.