The number 69296
69296 is a palindrome: it reads 69296 backwards too. Its prime factorisation is × 61 × 71. Divisors (20): 1, 2, 4, 8, 16, 61, 71, 122, 142, 244, 284, 488, 568, 976, 1136, 4331 … 69296.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69296: a palindrome: it reads 69296 backwards too.
- 2
69296 is composite. Its prime factorisation is
- 3
The divisors add up to 138384; without 69296 itself that is 69088, so 69296 is deficient (69088 is less than 69296). Euler's totient φ(69296) = 33600 numbers up to 69296 share no factor with it.
- 4
The digits of 69296 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69296 = 2^{4} \times 61 \times 71 \]69296 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 138384 |
| Euler totient φ(n) | 33600 |
| Square | 4801935616 |
| Cube | 332754930446336 |
| Square root | 263.241334 (= 4√4331) |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.9296 × |
69296 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand two hundred and ninety-six |
| Binary (base 2) | 10000111010110000 |
| Octal (base 8) | 207260 |
| Hexadecimal (base 16) | 10EB0 |
| Base 3 | 10112001112 |
| As time | 69296 seconds = 19 h 14 min 56 s |
Is 69296 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69296 ÷ 2 = 34648) | 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 | Yes (69296 ÷ 4 = 17324) | 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 2) | 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 | Yes (69296 ÷ 8 = 8662) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69296 a prime number?
No. 69296 = × 61 × 71, so it is divisible by 2.
What are the factors of 69296?
1, 2, 4, 8, 16, 61, 71, 122, 142, 244, 284, 488, 568, 976, 1136, 4331, 8662, 17324, 34648, 69296.
What is 69296 in binary?
10000111010110000 (hexadecimal 10EB0, octal 207260).
What is the square root of 69296?
About 263.2413, exactly 4√4331.
Is 69296 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 69296?
69296 is a palindrome: it reads 69296 backwards too.