The number 69147
69147 is a composite number with 16 divisors. Its prime factorisation is × 13 × 197. Divisors (16): 1, 3, 9, 13, 27, 39, 117, 197, 351, 591, 1773, 2561, 5319, 7683, 23049, 69147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69147: a Harshad number: divisible by its digit sum 27.
- 2
69147 is composite. Its prime factorisation is
- 3
The divisors add up to 110880; without 69147 itself that is 41733, so 69147 is deficient (41733 is less than 69147). Euler's totient φ(69147) = 42336 numbers up to 69147 share no factor with it.
- 4
The digits of 69147 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69147 = 3^{3} \times 13 \times 197 \]69147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 110880 |
| Euler totient φ(n) | 42336 |
| Square | 4781307609 |
| Cube | 330613077239523 |
| Square root | 262.958172 (= 3√7683) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 174 |
| Scientific notation | 6.9147 × |
69147 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand one hundred and forty-seven |
| Binary (base 2) | 10000111000011011 |
| Octal (base 8) | 207033 |
| Hexadecimal (base 16) | 10E1B |
| Base 3 | 10111212000 |
| As time | 69147 seconds = 19 h 12 min 27 s |
Is 69147 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 (69147 ÷ 3 = 23049) | 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 2) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (69147 ÷ 9 = 7683) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69147 a prime number?
No. 69147 = × 13 × 197, so it is divisible by 3.
What are the factors of 69147?
1, 3, 9, 13, 27, 39, 117, 197, 351, 591, 1773, 2561, 5319, 7683, 23049, 69147.
What is 69147 in binary?
10000111000011011 (hexadecimal 10E1B, octal 207033).
What is the square root of 69147?
About 262.9582, exactly 3√7683.
Is 69147 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 69147?
69147 is a Harshad number: divisible by its digit sum 27.