The number 62152
62152 is a composite number with 16 divisors. Its prime factorisation is × 17 × 457. Divisors (16): 1, 2, 4, 8, 17, 34, 68, 136, 457, 914, 1828, 3656, 7769, 15538, 31076, 62152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 62152: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
62152 is composite. Its prime factorisation is
- 3
The divisors add up to 123660; without 62152 itself that is 61508, so 62152 is deficient (61508 is less than 62152). Euler's totient φ(62152) = 29184 numbers up to 62152 share no factor with it.
- 4
The digits of 62152 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 117 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62152 = 2^{3} \times 17 \times 457 \]62152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 123660 |
| Euler totient φ(n) | 29184 |
| Square | 3862871104 |
| Cube | 240085164855808 |
| Square root | 249.303028 (= 2√15538) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 117 |
| Scientific notation | 6.2152 × |
62152 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand one hundred and fifty-two |
| Binary (base 2) | 1111001011001000 |
| Octal (base 8) | 171310 |
| Hexadecimal (base 16) | F2C8 |
| Base 3 | 10011020221 |
| As time | 62152 seconds = 17 h 15 min 52 s |
Is 62152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (62152 ÷ 2 = 31076) | 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 (62152 ÷ 4 = 15538) | 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 (62152 ÷ 8 = 7769) | 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 2) | 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 62152 a prime number?
No. 62152 = × 17 × 457, so it is divisible by 2.
What are the factors of 62152?
1, 2, 4, 8, 17, 34, 68, 136, 457, 914, 1828, 3656, 7769, 15538, 31076, 62152.
What is 62152 in binary?
1111001011001000 (hexadecimal F2C8, octal 171310).
What is the square root of 62152?
About 249.3030, exactly 2√15538.
Is 62152 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 62152?
62152 is a happy number: repeatedly adding the squares of its digits reaches 1.