The number 30902
30902 is a composite number with 4 divisors. Its prime factorisation is 2 × 15451. Divisors (4): 1, 2, 15451, 30902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30902: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 15451, the product of two primes.
- 2
30902 is composite. Its prime factorisation is
- 3
The divisors add up to 46356; without 30902 itself that is 15454, so 30902 is deficient (15454 is less than 30902). Euler's totient φ(30902) = 15450 numbers up to 30902 share no factor with it.
- 4
The digits of 30902 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 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30902 = 2 \times 15451 \]
30902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 46356 |
| Euler totient φ(n) | 15450 |
| Square | 954933604 |
| Cube | 29509358230808 |
| Square root | 175.789647 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 59 |
| Scientific notation | 3.0902 × |
30902 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and two |
| Binary (base 2) | 111100010110110 |
| Octal (base 8) | 74266 |
| Hexadecimal (base 16) | 78B6 |
| Base 3 | 1120101112 |
| As time | 30902 seconds = 8 h 35 min 2 s |
Is 30902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30902 ÷ 2 = 15451) | 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 | No (remainder 2) | 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 4) | 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 5) | 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 3) | 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 30902 a prime number?
No. 30902 = 2 × 15451, so it is divisible by 2.
What are the factors of 30902?
1, 2, 15451, 30902.
What is 30902 in binary?
111100010110110 (hexadecimal 78B6, octal 74266).
What is the square root of 30902?
About 175.7896.
Is 30902 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 30902?
30902 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 15451, the product of two primes.