The number 32902
32902 is a composite number with 4 divisors. Its prime factorisation is 2 × 16451. Divisors (4): 1, 2, 16451, 32902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 32902: a semiprime: 2 × 16451, the product of two primes.
- 2
32902 is composite. Its prime factorisation is
- 3
The divisors add up to 49356; without 32902 itself that is 16454, so 32902 is deficient (16454 is less than 32902). Euler's totient φ(32902) = 16450 numbers up to 32902 share no factor with it.
- 4
The digits of 32902 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 32902 = 2 \times 16451 \]
32902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49356 |
| Euler totient φ(n) | 16450 |
| Square | 1082541604 |
| Cube | 35617783854808 |
| Square root | 181.389085 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 116 |
| Scientific notation | 3.2902 × |
32902 in other forms
| Form | Value |
|---|---|
| In words | thirty-two thousand nine hundred and two |
| Binary (base 2) | 1000000010000110 |
| Octal (base 8) | 100206 |
| Hexadecimal (base 16) | 8086 |
| Base 3 | 1200010121 |
| As time | 32902 seconds = 9 h 8 min 22 s |
Is 32902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (32902 ÷ 2 = 16451) | 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 | No (remainder 2) | 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 2) | 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 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 32902 a prime number?
No. 32902 = 2 × 16451, so it is divisible by 2.
What are the factors of 32902?
1, 2, 16451, 32902.
What is 32902 in binary?
1000000010000110 (hexadecimal 8086, octal 100206).
What is the square root of 32902?
About 181.3891.
Is 32902 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 32902?
32902 is a semiprime: 2 × 16451, the product of two primes.