The number 35152
35152 is a composite number with 20 divisors. Its prime factorisation is × . Divisors (20): 1, 2, 4, 8, 13, 16, 26, 52, 104, 169, 208, 338, 676, 1352, 2197, 2704 … 35152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 35152: a Harshad number: divisible by its digit sum 16.
- 2
35152 is composite. Its prime factorisation is
- 3
The divisors add up to 73780; without 35152 itself that is 38628, so 35152 is abundant (38628 is more than 35152). Euler's totient φ(35152) = 16224 numbers up to 35152 share no factor with it.
- 4
The digits of 35152 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 98 steps to reach 1.
LaTeX source of the formulas on this page
\[ 35152 = 2^{4} \times 13^{3} \]35152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 73780 |
| Euler totient φ(n) | 16224 |
| Square | 1235663104 |
| Cube | 43436029431808 |
| Square root | 187.488666 (= 52√13) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 98 |
| Scientific notation | 3.5152 × |
35152 in other forms
| Form | Value |
|---|---|
| In words | thirty-five thousand one hundred and fifty-two |
| Binary (base 2) | 1000100101010000 |
| Octal (base 8) | 104520 |
| Hexadecimal (base 16) | 8950 |
| Base 3 | 1210012221 |
| As time | 35152 seconds = 9 h 45 min 52 s |
Is 35152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (35152 ÷ 2 = 17576) | 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 (35152 ÷ 4 = 8788) | 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 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 | Yes (35152 ÷ 8 = 4394) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 35152 a prime number?
No. 35152 = × , so it is divisible by 2.
What are the factors of 35152?
1, 2, 4, 8, 13, 16, 26, 52, 104, 169, 208, 338, 676, 1352, 2197, 2704, 4394, 8788, 17576, 35152.
What is 35152 in binary?
1000100101010000 (hexadecimal 8950, octal 104520).
What is the square root of 35152?
About 187.4887, exactly 52√13.
Is 35152 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 35152?
35152 is a Harshad number: divisible by its digit sum 16.