The number 52690
52690 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 479. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 479, 958, 2395, 4790, 5269, 10538, 26345, 52690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52690: a Harshad number: divisible by its digit sum 22.
- 2
52690 is composite. Its prime factorisation is
- 3
The divisors add up to 103680; without 52690 itself that is 50990, so 52690 is deficient (50990 is less than 52690). Euler's totient φ(52690) = 19120 numbers up to 52690 share no factor with it.
- 4
The digits of 52690 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 101 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52690 = 2 \times 5 \times 11 \times 479 \]
52690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 103680 |
| Euler totient φ(n) | 19120 |
| Square | 2776236100 |
| Cube | 146279880109000 |
| Square root | 229.543024 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 101 |
| Scientific notation | 5.269 × |
52690 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand six hundred and ninety |
| Binary (base 2) | 1100110111010010 |
| Octal (base 8) | 146722 |
| Hexadecimal (base 16) | CDD2 |
| Base 3 | 2200021111 |
| As time | 52690 seconds = 14 h 38 min 10 s |
Is 52690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (52690 ÷ 2 = 26345) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (52690 ÷ 5 = 10538) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (52690 ÷ 10 = 5269) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (52690 ÷ 11 = 4790) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52690 a prime number?
No. 52690 = 2 × 5 × 11 × 479, so it is divisible by 2.
What are the factors of 52690?
1, 2, 5, 10, 11, 22, 55, 110, 479, 958, 2395, 4790, 5269, 10538, 26345, 52690.
What is 52690 in binary?
1100110111010010 (hexadecimal CDD2, octal 146722).
What is the square root of 52690?
About 229.5430.
Is 52690 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 52690?
52690 is a Harshad number: divisible by its digit sum 22.