The number 62992
62992 is a composite number with 20 divisors. Its prime factorisation is × 31 × 127. Divisors (20): 1, 2, 4, 8, 16, 31, 62, 124, 127, 248, 254, 496, 508, 1016, 2032, 3937 … 62992.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
62992 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
62992 is composite. Its prime factorisation is
- 3
The divisors add up to 126976; without 62992 itself that is 63984, so 62992 is abundant (63984 is more than 62992). Euler's totient φ(62992) = 30240 numbers up to 62992 share no factor with it.
- 4
The digits of 62992 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 62992 = 2^{4} \times 31 \times 127 \]62992 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 126976 |
| Euler totient φ(n) | 30240 |
| Square | 3967992064 |
| Cube | 249951756095488 |
| Square root | 250.982071 (= 4√3937) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 130 |
| Scientific notation | 6.2992 × |
62992 in other forms
| Form | Value |
|---|---|
| In words | sixty-two thousand nine hundred and ninety-two |
| Binary (base 2) | 1111011000010000 |
| Octal (base 8) | 173020 |
| Hexadecimal (base 16) | F610 |
| Base 3 | 10012102001 |
| As time | 62992 seconds = 17 h 29 min 52 s |
Is 62992 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (62992 ÷ 2 = 31496) | 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 (62992 ÷ 4 = 15748) | 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 (62992 ÷ 8 = 7874) | 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 6) | 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 62992 a prime number?
No. 62992 = × 31 × 127, so it is divisible by 2.
What are the factors of 62992?
1, 2, 4, 8, 16, 31, 62, 124, 127, 248, 254, 496, 508, 1016, 2032, 3937, 7874, 15748, 31496, 62992.
What is 62992 in binary?
1111011000010000 (hexadecimal F610, octal 173020).
What is the square root of 62992?
About 250.9821, exactly 4√3937.
Is 62992 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 62992?
It is a composite number with 20 divisors.