The number 50695
50695 is a composite number with 4 divisors. Its prime factorisation is 5 × 10139. Divisors (4): 1, 5, 10139, 50695.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50695: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10139, the product of two primes.
- 2
50695 is composite. Its prime factorisation is
- 3
The divisors add up to 60840; without 50695 itself that is 10145, so 50695 is deficient (10145 is less than 50695). Euler's totient φ(50695) = 40552 numbers up to 50695 share no factor with it.
- 4
The digits of 50695 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50695 = 5 \times 10139 \]
50695 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 60840 |
| Euler totient φ(n) | 40552 |
| Square | 2569983025 |
| Cube | 130285289452375 |
| Square root | 225.155502 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.0695 × |
50695 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand six hundred and ninety-five |
| Binary (base 2) | 1100011000000111 |
| Octal (base 8) | 143007 |
| Hexadecimal (base 16) | C607 |
| Base 3 | 2120112121 |
| As time | 50695 seconds = 14 h 4 min 55 s |
Is 50695 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50695 ÷ 5 = 10139) | 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 | 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 7) | 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 5) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50695 a prime number?
No. 50695 = 5 × 10139, so it is divisible by 5.
What are the factors of 50695?
1, 5, 10139, 50695.
What is 50695 in binary?
1100011000000111 (hexadecimal C607, octal 143007).
What is the square root of 50695?
About 225.1555.
Is 50695 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 50695?
50695 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 10139, the product of two primes.