The number 83152
83152 is a composite number with 10 divisors. Its prime factorisation is × 5197. Divisors (10): 1, 2, 4, 8, 16, 5197, 10394, 20788, 41576, 83152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 83152: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
83152 is composite. Its prime factorisation is
- 3
The divisors add up to 161138; without 83152 itself that is 77986, so 83152 is deficient (77986 is less than 83152). Euler's totient φ(83152) = 41568 numbers up to 83152 share no factor with it.
- 4
The digits of 83152 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 151 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83152 = 2^{4} \times 5197 \]83152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 161138 |
| Euler totient φ(n) | 41568 |
| Square | 6914255104 |
| Cube | 574934140407808 |
| Square root | 288.360885 (= 4√5197) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 151 |
| Scientific notation | 8.3152 × |
83152 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand one hundred and fifty-two |
| Binary (base 2) | 10100010011010000 |
| Octal (base 8) | 242320 |
| Hexadecimal (base 16) | 144D0 |
| Base 3 | 11020001201 |
| As time | 83152 seconds = 23 h 5 min 52 s |
Is 83152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83152 ÷ 2 = 41576) | 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 (83152 ÷ 4 = 20788) | 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 6) | 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 (83152 ÷ 8 = 10394) | 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 3) | 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 83152 a prime number?
No. 83152 = × 5197, so it is divisible by 2.
What are the factors of 83152?
1, 2, 4, 8, 16, 5197, 10394, 20788, 41576, 83152.
What is 83152 in binary?
10100010011010000 (hexadecimal 144D0, octal 242320).
What is the square root of 83152?
About 288.3609, exactly 4√5197.
Is 83152 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 83152?
83152 is a happy number: repeatedly adding the squares of its digits reaches 1.