The number 44713
44713 is a composite number with 4 divisors. Its prime factorisation is 61 × 733. Divisors (4): 1, 61, 733, 44713.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 44713: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 733, the product of two primes.
- 2
44713 is composite. Its prime factorisation is
- 3
The divisors add up to 45508; without 44713 itself that is 795, so 44713 is deficient (795 is less than 44713). Euler's totient φ(44713) = 43920 numbers up to 44713 share no factor with it.
- 4
The digits of 44713 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 163 steps to reach 1.
LaTeX source of the formulas on this page
\[ 44713 = 61 \times 733 \]
44713 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 45508 |
| Euler totient φ(n) | 43920 |
| Square | 1999252369 |
| Cube | 89392571175097 |
| Square root | 211.454487 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 163 |
| Scientific notation | 4.4713 × |
44713 in other forms
| Form | Value |
|---|---|
| In words | forty-four thousand seven hundred and thirteen |
| Binary (base 2) | 1010111010101001 |
| Octal (base 8) | 127251 |
| Hexadecimal (base 16) | AEA9 |
| Base 3 | 2021100001 |
| As time | 44713 seconds = 12 h 25 min 13 s |
Is 44713 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 44713 a prime number?
No. 44713 = 61 × 733, so it is divisible by 61.
What are the factors of 44713?
1, 61, 733, 44713.
What is 44713 in binary?
1010111010101001 (hexadecimal AEA9, octal 127251).
What is the square root of 44713?
About 211.4545.
Is 44713 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 44713?
44713 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 61 × 733, the product of two primes.