The number 50013
50013 is a composite number with 6 divisors. Its prime factorisation is × 5557. Divisors (6): 1, 3, 9, 5557, 16671, 50013.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50013: a Harshad number: divisible by its digit sum 9.
- 2
50013 is composite. Its prime factorisation is
- 3
The divisors add up to 72254; without 50013 itself that is 22241, so 50013 is deficient (22241 is less than 50013). Euler's totient φ(50013) = 33336 numbers up to 50013 share no factor with it.
- 4
The digits of 50013 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50013 = 3^{2} \times 5557 \]50013 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 72254 |
| Euler totient φ(n) | 33336 |
| Square | 2501300169 |
| Cube | 125097525352197 |
| Square root | 223.635865 (= 3√5557) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0013 × |
50013 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and thirteen |
| Binary (base 2) | 1100001101011101 |
| Octal (base 8) | 141535 |
| Hexadecimal (base 16) | C35D |
| Base 3 | 2112121100 |
| As time | 50013 seconds = 13 h 53 min 33 s |
Is 50013 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 | Yes (50013 ÷ 3 = 16671) | 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 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50013 ÷ 9 = 5557) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50013 a prime number?
No. 50013 = × 5557, so it is divisible by 3.
What are the factors of 50013?
1, 3, 9, 5557, 16671, 50013.
What is 50013 in binary?
1100001101011101 (hexadecimal C35D, octal 141535).
What is the square root of 50013?
About 223.6359, exactly 3√5557.
Is 50013 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 50013?
50013 is a Harshad number: divisible by its digit sum 9.