The number 30460
30460 is a composite number with 12 divisors. Its prime factorisation is × 5 × 1523. Divisors (12): 1, 2, 4, 5, 10, 20, 1523, 3046, 6092, 7615, 15230, 30460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30460 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30460 is composite. Its prime factorisation is
- 3
The divisors add up to 64008; without 30460 itself that is 33548, so 30460 is abundant (33548 is more than 30460). Euler's totient φ(30460) = 12176 numbers up to 30460 share no factor with it.
- 4
The digits of 30460 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 59 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30460 = 2^{2} \times 5 \times 1523 \]30460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 64008 |
| Euler totient φ(n) | 12176 |
| Square | 927811600 |
| Cube | 28261141336000 |
| Square root | 174.527935 (= 2√7615) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 59 |
| Scientific notation | 3.046 × |
30460 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand four hundred and sixty |
| Binary (base 2) | 111011011111100 |
| Octal (base 8) | 73374 |
| Hexadecimal (base 16) | 76FC |
| Base 3 | 1112210011 |
| As time | 30460 seconds = 8 h 27 min 40 s |
Is 30460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30460 ÷ 2 = 15230) | 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 | Yes (30460 ÷ 4 = 7615) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (30460 ÷ 5 = 6092) | 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 4) | 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 | Yes (30460 ÷ 10 = 3046) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30460 a prime number?
No. 30460 = × 5 × 1523, so it is divisible by 2.
What are the factors of 30460?
1, 2, 4, 5, 10, 20, 1523, 3046, 6092, 7615, 15230, 30460.
What is 30460 in binary?
111011011111100 (hexadecimal 76FC, octal 73374).
What is the square root of 30460?
About 174.5279, exactly 2√7615.
Is 30460 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 30460?
It is a composite number with 12 divisors.