The number 49397
49397 is a composite number with 4 divisors. Its prime factorisation is 47 × 1051. Divisors (4): 1, 47, 1051, 49397.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49397: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1051, the product of two primes.
- 2
49397 is composite. Its prime factorisation is
- 3
The divisors add up to 50496; without 49397 itself that is 1099, so 49397 is deficient (1099 is less than 49397). Euler's totient φ(49397) = 48300 numbers up to 49397 share no factor with it.
- 4
The digits of 49397 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 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49397 = 47 \times 1051 \]
49397 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50496 |
| Euler totient φ(n) | 48300 |
| Square | 2440063609 |
| Cube | 120531822093773 |
| Square root | 222.254359 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 114 |
| Scientific notation | 4.9397 × |
49397 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and ninety-seven |
| Binary (base 2) | 1100000011110101 |
| Octal (base 8) | 140365 |
| Hexadecimal (base 16) | C0F5 |
| Base 3 | 2111202112 |
| As time | 49397 seconds = 13 h 43 min 17 s |
Is 49397 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 2) | 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 5) | 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 7) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49397 a prime number?
No. 49397 = 47 × 1051, so it is divisible by 47.
What are the factors of 49397?
1, 47, 1051, 49397.
What is 49397 in binary?
1100000011110101 (hexadecimal C0F5, octal 140365).
What is the square root of 49397?
About 222.2544.
Is 49397 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 49397?
49397 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 1051, the product of two primes.