The number 45551
45551 is a composite number with 8 divisors. Its prime factorisation is 11 × 41 × 101. Divisors (8): 1, 11, 41, 101, 451, 1111, 4141, 45551.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
45551 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
45551 is composite. Its prime factorisation is
- 3
The divisors add up to 51408; without 45551 itself that is 5857, so 45551 is deficient (5857 is less than 45551). Euler's totient φ(45551) = 40000 numbers up to 45551 share no factor with it.
- 4
The digits of 45551 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 207 steps to reach 1.
LaTeX source of the formulas on this page
\[ 45551 = 11 \times 41 \times 101 \]
45551 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 51408 |
| Euler totient φ(n) | 40000 |
| Square | 2074893601 |
| Cube | 94513478419151 |
| Square root | 213.426802 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 207 |
| Scientific notation | 4.5551 × |
45551 in other forms
| Form | Value |
|---|---|
| In words | forty-five thousand five hundred and fifty-one |
| Binary (base 2) | 1011000111101111 |
| Octal (base 8) | 130757 |
| Hexadecimal (base 16) | B1EF |
| Base 3 | 2022111002 |
| As time | 45551 seconds = 12 h 39 min 11 s |
Is 45551 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 | No (remainder 2) | 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 2) | 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 | Yes (45551 ÷ 11 = 4141) | 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 45551 a prime number?
No. 45551 = 11 × 41 × 101, so it is divisible by 11.
What are the factors of 45551?
1, 11, 41, 101, 451, 1111, 4141, 45551.
What is 45551 in binary?
1011000111101111 (hexadecimal B1EF, octal 130757).
What is the square root of 45551?
About 213.4268.
Is 45551 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 45551?
It is a composite number with 8 divisors.