The number 30364
30364 is a composite number with 6 divisors. Its prime factorisation is × 7591. Divisors (6): 1, 2, 4, 7591, 15182, 30364.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30364: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
30364 is composite. Its prime factorisation is
- 3
The divisors add up to 53144; without 30364 itself that is 22780, so 30364 is deficient (22780 is less than 30364). Euler's totient φ(30364) = 15180 numbers up to 30364 share no factor with it.
- 4
The digits of 30364 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 178 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30364 = 2^{2} \times 7591 \]30364 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 53144 |
| Euler totient φ(n) | 15180 |
| Square | 921972496 |
| Cube | 27994772868544 |
| Square root | 174.252690 (= 2√7591) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 178 |
| Scientific notation | 3.0364 × |
30364 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand three hundred and sixty-four |
| Binary (base 2) | 111011010011100 |
| Octal (base 8) | 73234 |
| Hexadecimal (base 16) | 769C |
| Base 3 | 1112122121 |
| As time | 30364 seconds = 8 h 26 min 4 s |
Is 30364 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30364 ÷ 2 = 15182) | 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 (30364 ÷ 4 = 7591) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 5) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | 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 30364 a prime number?
No. 30364 = × 7591, so it is divisible by 2.
What are the factors of 30364?
1, 2, 4, 7591, 15182, 30364.
What is 30364 in binary?
111011010011100 (hexadecimal 769C, octal 73234).
What is the square root of 30364?
About 174.2527, exactly 2√7591.
Is 30364 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 30364?
30364 is a happy number: repeatedly adding the squares of its digits reaches 1.