The number 45511
45511 is a composite number with 4 divisors. Its prime factorisation is 71 × 641. Divisors (4): 1, 71, 641, 45511.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 45511: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 641, the product of two primes.
- 2
45511 is composite. Its prime factorisation is
- 3
The divisors add up to 46224; without 45511 itself that is 713, so 45511 is deficient (713 is less than 45511). Euler's totient φ(45511) = 44800 numbers up to 45511 share no factor with it.
- 4
The digits of 45511 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45511 = 71 \times 641 \]
45511 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 46224 |
| Euler totient φ(n) | 44800 |
| Square | 2071251121 |
| Cube | 94264709767831 |
| Square root | 213.333073 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.5511 × |
45511 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand five hundred and eleven |
| Binary (base 2) | 1011000111000111 |
| Octal (base 8) | 130707 |
| Hexadecimal (base 16) | B1C7 |
| Base 3 | 2022102121 |
| As time | 45511 seconds = 12 h 38 min 31 s |
Is 45511 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 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 45511 a prime number?
No. 45511 = 71 × 641, so it is divisible by 71.
What are the factors of 45511?
1, 71, 641, 45511.
What is 45511 in binary?
1011000111000111 (hexadecimal B1C7, octal 130707).
What is the square root of 45511?
About 213.3331.
Is 45511 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 45511?
45511 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 641, the product of two primes.