The number 69136
69136 is a composite number with 20 divisors. Its prime factorisation is × 29 × 149. Divisors (20): 1, 2, 4, 8, 16, 29, 58, 116, 149, 232, 298, 464, 596, 1192, 2384, 4321 … 69136.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69136 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69136 is composite. Its prime factorisation is
- 3
The divisors add up to 139500; without 69136 itself that is 70364, so 69136 is abundant (70364 is more than 69136). Euler's totient φ(69136) = 33152 numbers up to 69136 share no factor with it.
- 4
The digits of 69136 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69136 = 2^{4} \times 29 \times 149 \]69136 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 139500 |
| Euler totient φ(n) | 33152 |
| Square | 4779786496 |
| Cube | 330455319187456 |
| Square root | 262.937255 (= 4√4321) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9136 × |
69136 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand one hundred and thirty-six |
| Binary (base 2) | 10000111000010000 |
| Octal (base 8) | 207020 |
| Hexadecimal (base 16) | 10E10 |
| Base 3 | 10111211121 |
| As time | 69136 seconds = 19 h 12 min 16 s |
Is 69136 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69136 ÷ 2 = 34568) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (69136 ÷ 4 = 17284) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (69136 ÷ 8 = 8642) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69136 a prime number?
No. 69136 = × 29 × 149, so it is divisible by 2.
What are the factors of 69136?
1, 2, 4, 8, 16, 29, 58, 116, 149, 232, 298, 464, 596, 1192, 2384, 4321, 8642, 17284, 34568, 69136.
What is 69136 in binary?
10000111000010000 (hexadecimal 10E10, octal 207020).
What is the square root of 69136?
About 262.9373, exactly 4√4321.
Is 69136 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 69136?
It is a composite number with 20 divisors.