The number 50956
50956 is a composite number with 6 divisors. Its prime factorisation is × 12739. Divisors (6): 1, 2, 4, 12739, 25478, 50956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50956: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50956 is composite. Its prime factorisation is
- 3
The divisors add up to 89180; without 50956 itself that is 38224, so 50956 is deficient (38224 is less than 50956). Euler's totient φ(50956) = 25476 numbers up to 50956 share no factor with it.
- 4
The digits of 50956 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50956 = 2^{2} \times 12739 \]50956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 89180 |
| Euler totient φ(n) | 25476 |
| Square | 2596513936 |
| Cube | 132307964122816 |
| Square root | 225.734357 (= 2√12739) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0956 × |
50956 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and fifty-six |
| Binary (base 2) | 1100011100001100 |
| Octal (base 8) | 143414 |
| Hexadecimal (base 16) | C70C |
| Base 3 | 2120220021 |
| As time | 50956 seconds = 14 h 9 min 16 s |
Is 50956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50956 ÷ 2 = 25478) | 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 | Yes (50956 ÷ 4 = 12739) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50956 a prime number?
No. 50956 = × 12739, so it is divisible by 2.
What are the factors of 50956?
1, 2, 4, 12739, 25478, 50956.
What is 50956 in binary?
1100011100001100 (hexadecimal C70C, octal 143414).
What is the square root of 50956?
About 225.7344, exactly 2√12739.
Is 50956 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 50956?
50956 is a happy number: repeatedly adding the squares of its digits reaches 1.