The number 49469
49469 is a composite number with 8 divisors. Its prime factorisation is 7 × 37 × 191. Divisors (8): 1, 7, 37, 191, 259, 1337, 7067, 49469.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49469: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49469 is composite. Its prime factorisation is
- 3
The divisors add up to 58368; without 49469 itself that is 8899, so 49469 is deficient (8899 is less than 49469). Euler's totient φ(49469) = 41040 numbers up to 49469 share no factor with it.
- 4
The digits of 49469 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49469 = 7 \times 37 \times 191 \]
49469 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 58368 |
| Euler totient φ(n) | 41040 |
| Square | 2447181961 |
| Cube | 121059644428709 |
| Square root | 222.416276 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9469 × |
49469 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and sixty-nine |
| Binary (base 2) | 1100000100111101 |
| Octal (base 8) | 140475 |
| Hexadecimal (base 16) | C13D |
| Base 3 | 2111212012 |
| As time | 49469 seconds = 13 h 44 min 29 s |
Is 49469 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 4) | 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 | Yes (49469 ÷ 7 = 7067) | 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 5) | 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 | No (remainder 2) | 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 49469 a prime number?
No. 49469 = 7 × 37 × 191, so it is divisible by 7.
What are the factors of 49469?
1, 7, 37, 191, 259, 1337, 7067, 49469.
What is 49469 in binary?
1100000100111101 (hexadecimal C13D, octal 140475).
What is the square root of 49469?
About 222.4163.
Is 49469 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 49469?
49469 is a happy number: repeatedly adding the squares of its digits reaches 1.