The number 30290
30290 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 233. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 130, 233, 466, 1165, 2330, 3029, 6058, 15145, 30290.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30290: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
30290 is composite. Its prime factorisation is
- 3
The divisors add up to 58968; without 30290 itself that is 28678, so 30290 is deficient (28678 is less than 30290). Euler's totient φ(30290) = 11136 numbers up to 30290 share no factor with it.
- 4
The digits of 30290 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 165 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30290 = 2 \times 5 \times 13 \times 233 \]
30290 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 58968 |
| Euler totient φ(n) | 11136 |
| Square | 917484100 |
| Cube | 27790593389000 |
| Square root | 174.040225 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 165 |
| Scientific notation | 3.029 × |
30290 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand two hundred and ninety |
| Binary (base 2) | 111011001010010 |
| Octal (base 8) | 73122 |
| Hexadecimal (base 16) | 7652 |
| Base 3 | 1112112212 |
| As time | 30290 seconds = 8 h 24 min 50 s |
Is 30290 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30290 ÷ 2 = 15145) | 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 (30290 ÷ 5 = 6058) | 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 | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (30290 ÷ 10 = 3029) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30290 a prime number?
No. 30290 = 2 × 5 × 13 × 233, so it is divisible by 2.
What are the factors of 30290?
1, 2, 5, 10, 13, 26, 65, 130, 233, 466, 1165, 2330, 3029, 6058, 15145, 30290.
What is 30290 in binary?
111011001010010 (hexadecimal 7652, octal 73122).
What is the square root of 30290?
About 174.0402.
Is 30290 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 30290?
30290 is a happy number: repeatedly adding the squares of its digits reaches 1.