The number 69390
69390 is a composite number with 32 divisors. Its prime factorisation is 2 × × 5 × 257. Divisors (32): 1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 257 … 69390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69390: a Harshad number: divisible by its digit sum 27.
- 2
69390 is composite. Its prime factorisation is
- 3
The divisors add up to 185760; without 69390 itself that is 116370, so 69390 is abundant (116370 is more than 69390). Euler's totient φ(69390) = 18432 numbers up to 69390 share no factor with it.
- 4
The digits of 69390 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 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69390 = 2 \times 3^{3} \times 5 \times 257 \]69390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 185760 |
| Euler totient φ(n) | 18432 |
| Square | 4814972100 |
| Cube | 334110914019000 |
| Square root | 263.419817 (= 3√7710) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 143 |
| Scientific notation | 6.939 × |
69390 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand three hundred and ninety |
| Binary (base 2) | 10000111100001110 |
| Octal (base 8) | 207416 |
| Hexadecimal (base 16) | 10F0E |
| Base 3 | 10112012000 |
| As time | 69390 seconds = 19 h 16 min 30 s |
Is 69390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69390 ÷ 2 = 34695) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (69390 ÷ 3 = 23130) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69390 ÷ 5 = 13878) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (69390 ÷ 6 = 11565) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (69390 ÷ 9 = 7710) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (69390 ÷ 10 = 6939) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69390 a prime number?
No. 69390 = 2 × × 5 × 257, so it is divisible by 2.
What are the factors of 69390?
1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 45, 54, 90, 135, 257, 270, 514, 771, 1285, 1542, 2313, 2570, 3855, 4626, 6939, 7710, 11565, 13878, 23130, 34695, 69390.
What is 69390 in binary?
10000111100001110 (hexadecimal 10F0E, octal 207416).
What is the square root of 69390?
About 263.4198, exactly 3√7710.
Is 69390 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 69390?
69390 is a Harshad number: divisible by its digit sum 27.