The number 44070
44070 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 13 × 113. Divisors (32): 1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 65, 78, 113, 130, 195 … 44070.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 44070: a Harshad number: divisible by its digit sum 15.
- 2
44070 is composite. Its prime factorisation is
- 3
The divisors add up to 114912; without 44070 itself that is 70842, so 44070 is abundant (70842 is more than 44070). Euler's totient φ(44070) = 10752 numbers up to 44070 share no factor with it.
- 4
The digits of 44070 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 163 steps to reach 1.
LaTeX source of the formulas on this page
\[ 44070 = 2 \times 3 \times 5 \times 13 \times 113 \]
44070 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 114912 |
| Euler totient φ(n) | 10752 |
| Square | 1942164900 |
| Cube | 85591207143000 |
| Square root | 209.928559 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 163 |
| Scientific notation | 4.407 × |
44070 in other forms
| Form | Value |
|---|---|
| In words | forty-four thousand and seventy |
| Binary (base 2) | 1010110000100110 |
| Octal (base 8) | 126046 |
| Hexadecimal (base 16) | AC26 |
| Base 3 | 2020110020 |
| As time | 44070 seconds = 12 h 14 min 30 s |
Is 44070 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (44070 ÷ 2 = 22035) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (44070 ÷ 3 = 14690) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (44070 ÷ 5 = 8814) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (44070 ÷ 6 = 7345) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (44070 ÷ 10 = 4407) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 44070 a prime number?
No. 44070 = 2 × 3 × 5 × 13 × 113, so it is divisible by 2.
What are the factors of 44070?
1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 65, 78, 113, 130, 195, 226, 339, 390, 565, 678, 1130, 1469, 1695, 2938, 3390, 4407, 7345, 8814, 14690, 22035, 44070.
What is 44070 in binary?
1010110000100110 (hexadecimal AC26, octal 126046).
What is the square root of 44070?
About 209.9286.
Is 44070 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 44070?
44070 is a Harshad number: divisible by its digit sum 15.