The number 14962
14962 is a composite number with 4 divisors. Its prime factorisation is 2 × 7481. Divisors (4): 1, 2, 7481, 14962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14962: a semiprime: 2 × 7481, the product of two primes.
- 2
14962 is composite. Its prime factorisation is
- 3
The divisors add up to 22446; without 14962 itself that is 7484, so 14962 is deficient (7484 is less than 14962). Euler's totient φ(14962) = 7480 numbers up to 14962 share no factor with it.
- 4
The digits of 14962 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 164 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14962 = 2 \times 7481 \]
14962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22446 |
| Euler totient φ(n) | 7480 |
| Square | 223861444 |
| Cube | 3349414925128 |
| Square root | 122.319254 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 164 |
| Scientific notation | 1.4962 × |
14962 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand nine hundred and sixty-two |
| Binary (base 2) | 11101001110010 |
| Octal (base 8) | 35162 |
| Hexadecimal (base 16) | 3A72 |
| Base 3 | 202112011 |
| As time | 14962 seconds = 4 h 9 min 22 s |
Is 14962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (14962 ÷ 2 = 7481) | 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 | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 4) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14962 a prime number?
No. 14962 = 2 × 7481, so it is divisible by 2.
What are the factors of 14962?
1, 2, 7481, 14962.
What is 14962 in binary?
11101001110010 (hexadecimal 3A72, octal 35162).
What is the square root of 14962?
About 122.3193.
Is 14962 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 14962?
14962 is a semiprime: 2 × 7481, the product of two primes.