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