The number 44051
44051 is a composite number with 12 divisors. Its prime factorisation is × 29 × 31. Divisors (12): 1, 7, 29, 31, 49, 203, 217, 899, 1421, 1519, 6293, 44051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
44051 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
44051 is composite. Its prime factorisation is
- 3
The divisors add up to 54720; without 44051 itself that is 10669, so 44051 is deficient (10669 is less than 44051). Euler's totient φ(44051) = 35280 numbers up to 44051 share no factor with it.
- 4
The digits of 44051 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 70 steps to reach 1.
LaTeX source of the formulas on this page
\[ 44051 = 7^{2} \times 29 \times 31 \]44051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 54720 |
| Euler totient φ(n) | 35280 |
| Square | 1940490601 |
| Cube | 85480551464651 |
| Square root | 209.883301 (= 7√899) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.4051 × |
44051 in other forms
| Form | Value |
|---|---|
| In words | forty-four thousand and fifty-one |
| Binary (base 2) | 1010110000010011 |
| Octal (base 8) | 126023 |
| Hexadecimal (base 16) | AC13 |
| Base 3 | 2020102112 |
| As time | 44051 seconds = 12 h 14 min 11 s |
Is 44051 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 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (44051 ÷ 7 = 6293) | 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 3) | 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 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 44051 a prime number?
No. 44051 = × 29 × 31, so it is divisible by 7.
What are the factors of 44051?
1, 7, 29, 31, 49, 203, 217, 899, 1421, 1519, 6293, 44051.
What is 44051 in binary?
1010110000010011 (hexadecimal AC13, octal 126023).
What is the square root of 44051?
About 209.8833, exactly 7√899.
Is 44051 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 44051?
It is a composite number with 12 divisors.