The number 50066
50066 is a composite number with 4 divisors. Its prime factorisation is 2 × 25033. Divisors (4): 1, 2, 25033, 50066.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50066: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 25033, the product of two primes.
- 2
50066 is composite. Its prime factorisation is
- 3
The divisors add up to 75102; without 50066 itself that is 25036, so 50066 is deficient (25036 is less than 50066). Euler's totient φ(50066) = 25032 numbers up to 50066 share no factor with it.
- 4
The digits of 50066 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50066 = 2 \times 25033 \]
50066 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 75102 |
| Euler totient φ(n) | 25032 |
| Square | 2506604356 |
| Cube | 125495653687496 |
| Square root | 223.754330 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0066 × |
50066 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and sixty-six |
| Binary (base 2) | 1100001110010010 |
| Octal (base 8) | 141622 |
| Hexadecimal (base 16) | C392 |
| Base 3 | 2112200022 |
| As time | 50066 seconds = 13 h 54 min 26 s |
Is 50066 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50066 ÷ 2 = 25033) | 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 1) | 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 2) | 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 8) | 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 5) | 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 50066 a prime number?
No. 50066 = 2 × 25033, so it is divisible by 2.
What are the factors of 50066?
1, 2, 25033, 50066.
What is 50066 in binary?
1100001110010010 (hexadecimal C392, octal 141622).
What is the square root of 50066?
About 223.7543.
Is 50066 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50066?
50066 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 25033, the product of two primes.