The number 30262
30262 is a composite number with 4 divisors. Its prime factorisation is 2 × 15131. Divisors (4): 1, 2, 15131, 30262.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30262: a semiprime: 2 × 15131, the product of two primes.
- 2
30262 is composite. Its prime factorisation is
- 3
The divisors add up to 45396; without 30262 itself that is 15134, so 30262 is deficient (15134 is less than 30262). Euler's totient φ(30262) = 15130 numbers up to 30262 share no factor with it.
- 4
The digits of 30262 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 222 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30262 = 2 \times 15131 \]
30262 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 45396 |
| Euler totient φ(n) | 15130 |
| Square | 915788644 |
| Cube | 27713595944728 |
| Square root | 173.959765 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 222 |
| Scientific notation | 3.0262 × |
30262 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand two hundred and sixty-two |
| Binary (base 2) | 111011000110110 |
| Octal (base 8) | 73066 |
| Hexadecimal (base 16) | 7636 |
| Base 3 | 1112111211 |
| As time | 30262 seconds = 8 h 24 min 22 s |
Is 30262 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30262 ÷ 2 = 15131) | 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 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 6) | 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 | 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 30262 a prime number?
No. 30262 = 2 × 15131, so it is divisible by 2.
What are the factors of 30262?
1, 2, 15131, 30262.
What is 30262 in binary?
111011000110110 (hexadecimal 7636, octal 73066).
What is the square root of 30262?
About 173.9598.
Is 30262 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 30262?
30262 is a semiprime: 2 × 15131, the product of two primes.