The number 30152
30152 is a composite number with 8 divisors. Its prime factorisation is × 3769. Divisors (8): 1, 2, 4, 8, 3769, 7538, 15076, 30152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
30152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
30152 is composite. Its prime factorisation is
- 3
The divisors add up to 56550; without 30152 itself that is 26398, so 30152 is deficient (26398 is less than 30152). Euler's totient φ(30152) = 15072 numbers up to 30152 share no factor with it.
- 4
The digits of 30152 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 116 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30152 = 2^{3} \times 3769 \]30152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 56550 |
| Euler totient φ(n) | 15072 |
| Square | 909143104 |
| Cube | 27412482871808 |
| Square root | 173.643313 (= 2√7538) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 116 |
| Scientific notation | 3.0152 × |
30152 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand one hundred and fifty-two |
| Binary (base 2) | 111010111001000 |
| Octal (base 8) | 72710 |
| Hexadecimal (base 16) | 75C8 |
| Base 3 | 1112100202 |
| As time | 30152 seconds = 8 h 22 min 32 s |
Is 30152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30152 ÷ 2 = 15076) | 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 | Yes (30152 ÷ 4 = 7538) | 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 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 | Yes (30152 ÷ 8 = 3769) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30152 a prime number?
No. 30152 = × 3769, so it is divisible by 2.
What are the factors of 30152?
1, 2, 4, 8, 3769, 7538, 15076, 30152.
What is 30152 in binary?
111010111001000 (hexadecimal 75C8, octal 72710).
What is the square root of 30152?
About 173.6433, exactly 2√7538.
Is 30152 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 30152?
It is a composite number with 8 divisors.