The number 62708
62708 is a composite number with 12 divisors. Its prime factorisation is × 61 × 257. Divisors (12): 1, 2, 4, 61, 122, 244, 257, 514, 1028, 15677, 31354, 62708.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
62708 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
62708 is composite. Its prime factorisation is
- 3
The divisors add up to 111972; without 62708 itself that is 49264, so 62708 is deficient (49264 is less than 62708). Euler's totient φ(62708) = 30720 numbers up to 62708 share no factor with it.
- 4
The digits of 62708 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62708 = 2^{2} \times 61 \times 257 \]62708 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 111972 |
| Euler totient φ(n) | 30720 |
| Square | 3932293264 |
| Cube | 246586245998912 |
| Square root | 250.415654 (= 2√15677) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 86 |
| Scientific notation | 6.2708 × |
62708 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand seven hundred and eight |
| Binary (base 2) | 1111010011110100 |
| Octal (base 8) | 172364 |
| Hexadecimal (base 16) | F4F4 |
| Base 3 | 10012000112 |
| As time | 62708 seconds = 17 h 25 min 8 s |
Is 62708 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (62708 ÷ 2 = 31354) | 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 (62708 ÷ 4 = 15677) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 2) | 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 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 62708 a prime number?
No. 62708 = × 61 × 257, so it is divisible by 2.
What are the factors of 62708?
1, 2, 4, 61, 122, 244, 257, 514, 1028, 15677, 31354, 62708.
What is 62708 in binary?
1111010011110100 (hexadecimal F4F4, octal 172364).
What is the square root of 62708?
About 250.4157, exactly 2√15677.
Is 62708 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 62708?
It is a composite number with 12 divisors.