The number 69536
69536 is a composite number with 24 divisors. Its prime factorisation is × 41 × 53. Divisors (24): 1, 2, 4, 8, 16, 32, 41, 53, 82, 106, 164, 212, 328, 424, 656, 848 … 69536.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69536 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69536 is composite. Its prime factorisation is
- 3
The divisors add up to 142884; without 69536 itself that is 73348, so 69536 is abundant (73348 is more than 69536). Euler's totient φ(69536) = 33280 numbers up to 69536 share no factor with it.
- 4
The digits of 69536 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69536 = 2^{5} \times 41 \times 53 \]69536 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 142884 |
| Euler totient φ(n) | 33280 |
| Square | 4835255296 |
| Cube | 336224312262656 |
| Square root | 263.696796 (= 4√4346) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.9536 × |
69536 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand five hundred and thirty-six |
| Binary (base 2) | 10000111110100000 |
| Octal (base 8) | 207640 |
| Hexadecimal (base 16) | 10FA0 |
| Base 3 | 10112101102 |
| As time | 69536 seconds = 19 h 18 min 56 s |
Is 69536 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69536 ÷ 2 = 34768) | 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 (69536 ÷ 4 = 17384) | 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 5) | 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 (69536 ÷ 8 = 8692) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 69536 a prime number?
No. 69536 = × 41 × 53, so it is divisible by 2.
What are the factors of 69536?
1, 2, 4, 8, 16, 32, 41, 53, 82, 106, 164, 212, 328, 424, 656, 848, 1312, 1696, 2173, 4346, 8692, 17384, 34768, 69536.
What is 69536 in binary?
10000111110100000 (hexadecimal 10FA0, octal 207640).
What is the square root of 69536?
About 263.6968, exactly 4√4346.
Is 69536 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 69536?
It is a composite number with 24 divisors.