The number 69290
69290 is a composite number with 24 divisors. Its prime factorisation is 2 × 5 × × 41. Divisors (24): 1, 2, 5, 10, 13, 26, 41, 65, 82, 130, 169, 205, 338, 410, 533, 845 … 69290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 69290: a Harshad number: divisible by its digit sum 26.
- 2
69290 is composite. Its prime factorisation is
- 3
The divisors add up to 138348; without 69290 itself that is 69058, so 69290 is deficient (69058 is less than 69290). Euler's totient φ(69290) = 24960 numbers up to 69290 share no factor with it.
- 4
The digits of 69290 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 69290 = 2 \times 5 \times 13^{2} \times 41 \]69290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 138348 |
| Euler totient φ(n) | 24960 |
| Square | 4801104100 |
| Cube | 332668503089000 |
| Square root | 263.229938 (= 13√410) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 50 |
| Scientific notation | 6.929 × |
69290 in other forms
| Form | Value |
|---|---|
| In words | sixty-nine thousand two hundred and ninety |
| Binary (base 2) | 10000111010101010 |
| Octal (base 8) | 207252 |
| Hexadecimal (base 16) | 10EAA |
| Base 3 | 10112001022 |
| As time | 69290 seconds = 19 h 14 min 50 s |
Is 69290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (69290 ÷ 2 = 34645) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (69290 ÷ 5 = 13858) | 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 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (69290 ÷ 10 = 6929) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 69290 a prime number?
No. 69290 = 2 × 5 × × 41, so it is divisible by 2.
What are the factors of 69290?
1, 2, 5, 10, 13, 26, 41, 65, 82, 130, 169, 205, 338, 410, 533, 845, 1066, 1690, 2665, 5330, 6929, 13858, 34645, 69290.
What is 69290 in binary?
10000111010101010 (hexadecimal 10EAA, octal 207252).
What is the square root of 69290?
About 263.2299, exactly 13√410.
Is 69290 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 69290?
69290 is a Harshad number: divisible by its digit sum 26.