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