The number 51451
51451 is a composite number with 4 divisors. Its prime factorisation is 23 × 2237. Divisors (4): 1, 23, 2237, 51451.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51451: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 23 × 2237, the product of two primes.
- 2
51451 is composite. Its prime factorisation is
- 3
The divisors add up to 53712; without 51451 itself that is 2261, so 51451 is deficient (2261 is less than 51451). Euler's totient φ(51451) = 49192 numbers up to 51451 share no factor with it.
- 4
The digits of 51451 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 171 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51451 = 23 \times 2237 \]
51451 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53712 |
| Euler totient φ(n) | 49192 |
| Square | 2647205401 |
| Cube | 136201365086851 |
| Square root | 226.828129 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 171 |
| Scientific notation | 5.1451 × |
51451 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand four hundred and fifty-one |
| Binary (base 2) | 1100100011111011 |
| Octal (base 8) | 144373 |
| Hexadecimal (base 16) | C8FB |
| Base 3 | 2121120121 |
| As time | 51451 seconds = 14 h 17 min 31 s |
Is 51451 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 1) | 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 3) | 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 51451 a prime number?
No. 51451 = 23 × 2237, so it is divisible by 23.
What are the factors of 51451?
1, 23, 2237, 51451.
What is 51451 in binary?
1100100011111011 (hexadecimal C8FB, octal 144373).
What is the square root of 51451?
About 226.8281.
Is 51451 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 51451?
51451 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 23 × 2237, the product of two primes.