The number 49111
49111 is a composite number with 4 divisors. Its prime factorisation is 67 × 733. Divisors (4): 1, 67, 733, 49111.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49111: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 67 × 733, the product of two primes.
- 2
49111 is composite. Its prime factorisation is
- 3
The divisors add up to 49912; without 49111 itself that is 801, so 49111 is deficient (801 is less than 49111). Euler's totient φ(49111) = 48312 numbers up to 49111 share no factor with it.
- 4
The digits of 49111 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 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49111 = 67 \times 733 \]
49111 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49912 |
| Euler totient φ(n) | 48312 |
| Square | 2411890321 |
| Cube | 118450345554631 |
| Square root | 221.610018 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.9111 × |
49111 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and eleven |
| Binary (base 2) | 1011111111010111 |
| Octal (base 8) | 137727 |
| Hexadecimal (base 16) | BFD7 |
| Base 3 | 2111100221 |
| As time | 49111 seconds = 13 h 38 min 31 s |
Is 49111 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 | No (remainder 1) | 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 6) | 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 1) | 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 49111 a prime number?
No. 49111 = 67 × 733, so it is divisible by 67.
What are the factors of 49111?
1, 67, 733, 49111.
What is 49111 in binary?
1011111111010111 (hexadecimal BFD7, octal 137727).
What is the square root of 49111?
About 221.6100.
Is 49111 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 49111?
49111 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 67 × 733, the product of two primes.