The number 12962
12962 is a composite number with 4 divisors. Its prime factorisation is 2 × 6481. Divisors (4): 1, 2, 6481, 12962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12962: a semiprime: 2 × 6481, the product of two primes.
- 2
12962 is composite. Its prime factorisation is
- 3
The divisors add up to 19446; without 12962 itself that is 6484, so 12962 is deficient (6484 is less than 12962). Euler's totient φ(12962) = 6480 numbers up to 12962 share no factor with it.
- 4
The digits of 12962 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 169 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12962 = 2 \times 6481 \]
12962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19446 |
| Euler totient φ(n) | 6480 |
| Square | 168013444 |
| Cube | 2177790261128 |
| Square root | 113.850780 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 169 |
| Scientific notation | 1.2962 × |
12962 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand nine hundred and sixty-two |
| Binary (base 2) | 11001010100010 |
| Octal (base 8) | 31242 |
| Hexadecimal (base 16) | 32A2 |
| Base 3 | 122210002 |
| As time | 12962 seconds = 3 h 36 min 2 s |
Is 12962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12962 ÷ 2 = 6481) | 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 | No (remainder 2) | 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 2) | 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 | No (remainder 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12962 a prime number?
No. 12962 = 2 × 6481, so it is divisible by 2.
What are the factors of 12962?
1, 2, 6481, 12962.
What is 12962 in binary?
11001010100010 (hexadecimal 32A2, octal 31242).
What is the square root of 12962?
About 113.8508.
Is 12962 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 12962?
12962 is a semiprime: 2 × 6481, the product of two primes.