The number 32690
32690 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 467. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 467, 934, 2335, 3269, 4670, 6538, 16345, 32690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32690: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
32690 is composite. Its prime factorisation is
- 3
The divisors add up to 67392; without 32690 itself that is 34702, so 32690 is abundant (34702 is more than 32690). Euler's totient φ(32690) = 11184 numbers up to 32690 share no factor with it.
- 4
The digits of 32690 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 54 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32690 = 2 \times 5 \times 7 \times 467 \]
32690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 67392 |
| Euler totient φ(n) | 11184 |
| Square | 1068636100 |
| Cube | 34933714109000 |
| Square root | 180.803761 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 54 |
| Scientific notation | 3.269 × |
32690 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand six hundred and ninety |
| Binary (base 2) | 111111110110010 |
| Octal (base 8) | 77662 |
| Hexadecimal (base 16) | 7FB2 |
| Base 3 | 1122211202 |
| As time | 32690 seconds = 9 h 4 min 50 s |
Is 32690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32690 ÷ 2 = 16345) | 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 (32690 ÷ 5 = 6538) | 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 | Yes (32690 ÷ 7 = 4670) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (32690 ÷ 10 = 3269) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 32690 a prime number?
No. 32690 = 2 × 5 × 7 × 467, so it is divisible by 2.
What are the factors of 32690?
1, 2, 5, 7, 10, 14, 35, 70, 467, 934, 2335, 3269, 4670, 6538, 16345, 32690.
What is 32690 in binary?
111111110110010 (hexadecimal 7FB2, octal 77662).
What is the square root of 32690?
About 180.8038.
Is 32690 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 32690?
32690 is a happy number: repeatedly adding the squares of its digits reaches 1.