The number 30642
30642 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 5107. Divisors (8): 1, 2, 3, 6, 5107, 10214, 15321, 30642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30642 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30642 is composite. Its prime factorisation is
- 3
The divisors add up to 61296; without 30642 itself that is 30654, so 30642 is abundant (30654 is more than 30642). Euler's totient φ(30642) = 10212 numbers up to 30642 share no factor with it.
- 4
The digits of 30642 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30642 = 2 \times 3 \times 5107 \]
30642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 61296 |
| Euler totient φ(n) | 10212 |
| Square | 938932164 |
| Cube | 28770759369288 |
| Square root | 175.048565 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 41 |
| Scientific notation | 3.0642 × |
30642 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand six hundred and forty-two |
| Binary (base 2) | 111011110110010 |
| Octal (base 8) | 73662 |
| Hexadecimal (base 16) | 77B2 |
| Base 3 | 1120000220 |
| As time | 30642 seconds = 8 h 30 min 42 s |
Is 30642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30642 ÷ 2 = 15321) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (30642 ÷ 3 = 10214) | 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 | Yes (30642 ÷ 6 = 5107) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | 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 7) | 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 30642 a prime number?
No. 30642 = 2 × 3 × 5107, so it is divisible by 2.
What are the factors of 30642?
1, 2, 3, 6, 5107, 10214, 15321, 30642.
What is 30642 in binary?
111011110110010 (hexadecimal 77B2, octal 73662).
What is the square root of 30642?
About 175.0486.
Is 30642 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 30642?
It is a composite number with 8 divisors.