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