The number 41551
41551 is a composite number with 4 divisors. Its prime factorisation is 37 × 1123. Divisors (4): 1, 37, 1123, 41551.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 41551: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 37 × 1123, the product of two primes.
- 2
41551 is composite. Its prime factorisation is
- 3
The divisors add up to 42712; without 41551 itself that is 1161, so 41551 is deficient (1161 is less than 41551). Euler's totient φ(41551) = 40392 numbers up to 41551 share no factor with it.
- 4
The digits of 41551 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 75 steps to reach 1.
LaTeX source of the formulas on this page
\[ 41551 = 37 \times 1123 \]
41551 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 42712 |
| Euler totient φ(n) | 40392 |
| Square | 1726485601 |
| Cube | 71737203207151 |
| Square root | 203.840624 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 75 |
| Scientific notation | 4.1551 × |
41551 in other forms
| Form | Value |
|---|---|
| In words | forty-one thousand five hundred and fifty-one |
| Binary (base 2) | 1010001001001111 |
| Octal (base 8) | 121117 |
| Hexadecimal (base 16) | A24F |
| Base 3 | 2002222221 |
| As time | 41551 seconds = 11 h 32 min 31 s |
Is 41551 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 6) | 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 41551 a prime number?
No. 41551 = 37 × 1123, so it is divisible by 37.
What are the factors of 41551?
1, 37, 1123, 41551.
What is 41551 in binary?
1010001001001111 (hexadecimal A24F, octal 121117).
What is the square root of 41551?
About 203.8406.
Is 41551 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 41551?
41551 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 37 × 1123, the product of two primes.