The number 44861
44861 is a composite number with 4 divisors. Its prime factorisation is 113 × 397. Divisors (4): 1, 113, 397, 44861.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 44861: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 113 × 397, the product of two primes.
- 2
44861 is composite. Its prime factorisation is
- 3
The divisors add up to 45372; without 44861 itself that is 511, so 44861 is deficient (511 is less than 44861). Euler's totient φ(44861) = 44352 numbers up to 44861 share no factor with it.
- 4
The digits of 44861 add up to 23, 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
\[ 44861 = 113 \times 397 \]
44861 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 45372 |
| Euler totient φ(n) | 44352 |
| Square | 2012509321 |
| Cube | 90283180649381 |
| Square root | 211.804155 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 70 |
| Scientific notation | 4.4861 × |
44861 in other forms
| Form | Value |
|---|---|
| In words | forty-four thousand eight hundred and sixty-one |
| Binary (base 2) | 1010111100111101 |
| Octal (base 8) | 127475 |
| Hexadecimal (base 16) | AF3D |
| Base 3 | 2021112112 |
| As time | 44861 seconds = 12 h 27 min 41 s |
Is 44861 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 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 | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 44861 a prime number?
No. 44861 = 113 × 397, so it is divisible by 113.
What are the factors of 44861?
1, 113, 397, 44861.
What is 44861 in binary?
1010111100111101 (hexadecimal AF3D, octal 127475).
What is the square root of 44861?
About 211.8042.
Is 44861 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 44861?
44861 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 113 × 397, the product of two primes.