The number 50533
50533 is a composite number with 4 divisors. Its prime factorisation is 7 × 7219. Divisors (4): 1, 7, 7219, 50533.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50533: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 7219, the product of two primes.
- 2
50533 is composite. Its prime factorisation is
- 3
The divisors add up to 57760; without 50533 itself that is 7227, so 50533 is deficient (7227 is less than 50533). Euler's totient φ(50533) = 43308 numbers up to 50533 share no factor with it.
- 4
The digits of 50533 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50533 = 7 \times 7219 \]
50533 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 57760 |
| Euler totient φ(n) | 43308 |
| Square | 2553584089 |
| Cube | 129040264769437 |
| Square root | 224.795463 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0533 × |
50533 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and thirty-three |
| Binary (base 2) | 1100010101100101 |
| Octal (base 8) | 142545 |
| Hexadecimal (base 16) | C565 |
| Base 3 | 2120022121 |
| As time | 50533 seconds = 14 h 2 min 13 s |
Is 50533 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50533 ÷ 7 = 7219) | 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50533 a prime number?
No. 50533 = 7 × 7219, so it is divisible by 7.
What are the factors of 50533?
1, 7, 7219, 50533.
What is 50533 in binary?
1100010101100101 (hexadecimal C565, octal 142545).
What is the square root of 50533?
About 224.7955.
Is 50533 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50533?
50533 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 7 × 7219, the product of two primes.