The number 69148
69148 is a composite number with 12 divisors. Its prime factorisation is × 59 × 293. Divisors (12): 1, 2, 4, 59, 118, 236, 293, 586, 1172, 17287, 34574, 69148.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
69148 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
69148 is composite. Its prime factorisation is
- 3
The divisors add up to 123480; without 69148 itself that is 54332, so 69148 is deficient (54332 is less than 69148). Euler's totient φ(69148) = 33872 numbers up to 69148 share no factor with it.
- 4
The digits of 69148 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69148 = 2^{2} \times 59 \times 293 \]69148 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 123480 |
| Euler totient φ(n) | 33872 |
| Square | 4781445904 |
| Cube | 330627421369792 |
| Square root | 262.960073 (= 2√17287) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9148 × |
69148 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand one hundred and forty-eight |
| Binary (base 2) | 10000111000011100 |
| Octal (base 8) | 207034 |
| Hexadecimal (base 16) | 10E1C |
| Base 3 | 10111212001 |
| As time | 69148 seconds = 19 h 12 min 28 s |
Is 69148 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69148 ÷ 2 = 34574) | 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 (69148 ÷ 4 = 17287) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 2) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 69148 a prime number?
No. 69148 = × 59 × 293, so it is divisible by 2.
What are the factors of 69148?
1, 2, 4, 59, 118, 236, 293, 586, 1172, 17287, 34574, 69148.
What is 69148 in binary?
10000111000011100 (hexadecimal 10E1C, octal 207034).
What is the square root of 69148?
About 262.9601, exactly 2√17287.
Is 69148 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 69148?
It is a composite number with 12 divisors.