The number 30502
30502 is a composite number with 8 divisors. Its prime factorisation is 2 × 101 × 151. Divisors (8): 1, 2, 101, 151, 202, 302, 15251, 30502.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30502 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30502 is composite. Its prime factorisation is
- 3
The divisors add up to 46512; without 30502 itself that is 16010, so 30502 is deficient (16010 is less than 30502). Euler's totient φ(30502) = 15000 numbers up to 30502 share no factor with it.
- 4
The digits of 30502 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 85 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30502 = 2 \times 101 \times 151 \]
30502 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 46512 |
| Euler totient φ(n) | 15000 |
| Square | 930372004 |
| Cube | 28378206866008 |
| Square root | 174.648218 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 85 |
| Scientific notation | 3.0502 × |
30502 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand five hundred and two |
| Binary (base 2) | 111011100100110 |
| Octal (base 8) | 73446 |
| Hexadecimal (base 16) | 7726 |
| Base 3 | 1112211201 |
| As time | 30502 seconds = 8 h 28 min 22 s |
Is 30502 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30502 ÷ 2 = 15251) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 10) | 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 30502 a prime number?
No. 30502 = 2 × 101 × 151, so it is divisible by 2.
What are the factors of 30502?
1, 2, 101, 151, 202, 302, 15251, 30502.
What is 30502 in binary?
111011100100110 (hexadecimal 7726, octal 73446).
What is the square root of 30502?
About 174.6482.
Is 30502 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 30502?
It is a composite number with 8 divisors.