The number 49269
49269 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 1493. Divisors (8): 1, 3, 11, 33, 1493, 4479, 16423, 49269.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
49269 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
49269 is composite. Its prime factorisation is
- 3
The divisors add up to 71712; without 49269 itself that is 22443, so 49269 is deficient (22443 is less than 49269). Euler's totient φ(49269) = 29840 numbers up to 49269 share no factor with it.
- 4
The digits of 49269 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49269 = 3 \times 11 \times 1493 \]
49269 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 71712 |
| Euler totient φ(n) | 29840 |
| Square | 2427434361 |
| Cube | 119597263532109 |
| Square root | 221.966214 |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9269 × |
49269 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and sixty-nine |
| Binary (base 2) | 1100000001110101 |
| Octal (base 8) | 140165 |
| Hexadecimal (base 16) | C075 |
| Base 3 | 2111120210 |
| As time | 49269 seconds = 13 h 41 min 9 s |
Is 49269 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 (49269 ÷ 3 = 16423) | 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 4) | 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 3) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (49269 ÷ 11 = 4479) | 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 49269 a prime number?
No. 49269 = 3 × 11 × 1493, so it is divisible by 3.
What are the factors of 49269?
1, 3, 11, 33, 1493, 4479, 16423, 49269.
What is 49269 in binary?
1100000001110101 (hexadecimal C075, octal 140165).
What is the square root of 49269?
About 221.9662.
Is 49269 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 49269?
It is a composite number with 8 divisors.