The number 49431
49431 is a composite number with 4 divisors. Its prime factorisation is 3 × 16477. Divisors (4): 1, 3, 16477, 49431.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49431: a semiprime: 3 × 16477, the product of two primes.
- 2
49431 is composite. Its prime factorisation is
- 3
The divisors add up to 65912; without 49431 itself that is 16481, so 49431 is deficient (16481 is less than 49431). Euler's totient φ(49431) = 32952 numbers up to 49431 share no factor with it.
- 4
The digits of 49431 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 119 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49431 = 3 \times 16477 \]
49431 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 65912 |
| Euler totient φ(n) | 32952 |
| Square | 2443423761 |
| Cube | 120780879929991 |
| Square root | 222.330835 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 119 |
| Scientific notation | 4.9431 × |
49431 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand four hundred and thirty-one |
| Binary (base 2) | 1100000100010111 |
| Octal (base 8) | 140427 |
| Hexadecimal (base 16) | C117 |
| Base 3 | 2111210210 |
| As time | 49431 seconds = 13 h 43 min 51 s |
Is 49431 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 (49431 ÷ 3 = 16477) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 3) | 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49431 a prime number?
No. 49431 = 3 × 16477, so it is divisible by 3.
What are the factors of 49431?
1, 3, 16477, 49431.
What is 49431 in binary?
1100000100010111 (hexadecimal C117, octal 140427).
What is the square root of 49431?
About 222.3308.
Is 49431 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 49431?
49431 is a semiprime: 3 × 16477, the product of two primes.