The number 50954
50954 is a composite number with 8 divisors. Its prime factorisation is 2 × 73 × 349. Divisors (8): 1, 2, 73, 146, 349, 698, 25477, 50954.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50954 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50954 is composite. Its prime factorisation is
- 3
The divisors add up to 77700; without 50954 itself that is 26746, so 50954 is deficient (26746 is less than 50954). Euler's totient φ(50954) = 25056 numbers up to 50954 share no factor with it.
- 4
The digits of 50954 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50954 = 2 \times 73 \times 349 \]
50954 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77700 |
| Euler totient φ(n) | 25056 |
| Square | 2596310116 |
| Cube | 132292385650664 |
| Square root | 225.729927 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0954 × |
50954 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and fifty-four |
| Binary (base 2) | 1100011100001010 |
| Octal (base 8) | 143412 |
| Hexadecimal (base 16) | C70A |
| Base 3 | 2120220012 |
| As time | 50954 seconds = 14 h 9 min 14 s |
Is 50954 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50954 ÷ 2 = 25477) | 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 4) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50954 a prime number?
No. 50954 = 2 × 73 × 349, so it is divisible by 2.
What are the factors of 50954?
1, 2, 73, 146, 349, 698, 25477, 50954.
What is 50954 in binary?
1100011100001010 (hexadecimal C70A, octal 143412).
What is the square root of 50954?
About 225.7299.
Is 50954 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50954?
It is a composite number with 8 divisors.